Comparing object encodings.

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

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

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

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Combinatory logic and lambda calculus (03B40)

Related Items (10)

Semantic types and approximation for Featherweight Java ⋮ A calculus with recursive types, record concatenation and subtyping ⋮ Verified software units ⋮ A CuCh Interpretation of an Object-Oriented Language1 1Partially supported by MURST Cofin '99 TOSCA. ⋮ On the decidability of subtyping with bounded existential types and implementation constraints ⋮ A declarative framework for object-oriented programming with genetic inheritance ⋮ Two provably secure \(k\)-out-of-\(n\) oblivious transfer schemes ⋮ Basic theory of \(F\)-bounded quantification. ⋮ Type destructors ⋮ Foundations for virtual types

Uses Software

• Smalltalk
• BETA
• PolyTOIL
• Simula 67

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Comparing object encodings.