Comparing object encodings.

DOI10.1006/inco.1999.2829zbMath1045.68528MaRDI QIDQ1854318

Luca Cardelli, Kim B. Bruce, Benjamin C. Pierce

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2829

zbMATH Keywords

typed lambda-calculus

Mathematics Subject Classification ID

68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

03B40: Combinatory logic and lambda calculus

Related Items

A declarative framework for object-oriented programming with genetic inheritance, Basic theory of \(F\)-bounded quantification., Type destructors, Foundations for virtual types, Two provably secure \(k\)-out-of-\(n\) oblivious transfer schemes

Uses Software

• Smalltalk
• BETA
• PolyTOIL
• Simula 67

Cites Work

• Divergence of \(F_{\leq}\) type checking
• Bounded quantification is undecidable
• Higher-order subtyping
• Coherence of subsumption, minimum typing and type-checking in F ≤
• A paradigmatic object-oriented programming language: Design, static typing and semantics
• Simple type-theoretic foundations for object-oriented programming
• An approach to object semantics based on terminal co-algebras
• A semantic basis for Quest
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item