Back to Search
Start Over
The recursive record semantics of objects revisited
- Source :
- Journal of Functional Programming. 14:263-315
- Publication Year :
- 2004
- Publisher :
- Cambridge University Press (CUP), 2004.
-
Abstract
- In a call-by-value language, representing objects as recursive records requires using an unsafe fixpoint. We design, for a core language including extensible records, a type system which rules out unsafe recursion and still supports the construction of a principal type for each typable term. We illustrate the expressive power of this language with respect to object-oriented programming by introducing a sub-language for “mixin-based” programming.
- Subjects :
- Record type
Recursion
Theoretical computer science
Semantics (computer science)
Computer science
Programming language
020207 software engineering
0102 computer and information sciences
02 engineering and technology
Term (logic)
Fixed point
computer.software_genre
01 natural sciences
Expressive power
010201 computation theory & mathematics
TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS
0202 electrical engineering, electronic engineering, information engineering
Principal type
computer
Core language
Software
Subjects
Details
- ISSN :
- 14697653 and 09567968
- Volume :
- 14
- Database :
- OpenAIRE
- Journal :
- Journal of Functional Programming
- Accession number :
- edsair.doi...........dcdf9ed905f6db53dc58b30725191e0d
- Full Text :
- https://doi.org/10.1017/s0956796803004775