Comparing object encodings.

DOI10.1006/INCO.1999.2829MaRDI QIDQ1854318zbMATH OpenOpenAlexFDO

Authors Kim B. Bruce, Luca Cardelli, 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

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

Recommendations

• Simple type-theoretic foundations for object-oriented programming
• Typed interpretations of extensible objects
• A proposal for comparison of types in Pascal and associated semantic models
• scientific article; zbMATH DE number 1390057
• Encoding FIX in Object Calculi

Cites work

• A paradigmatic object-oriented programming language: Design, static typing and semantics
• A semantic basis for Quest
• An approach to object semantics based on terminal co-algebras
• Bounded quantification is undecidable
• Coherence of subsumption, minimum typing and type-checking in F ≤
• Divergence of \(F_{\leq}\) type checking
• Higher-order subtyping
• scientific article; zbMATH DE number 986404 (Why is no real title available?)
• scientific article; zbMATH DE number 3864476 (Why is no real title available?)
• scientific article; zbMATH DE number 3821076 (Why is no real title available?)
• scientific article; zbMATH DE number 3986617 (Why is no real title available?)
• scientific article; zbMATH DE number 512778 (Why is no real title available?)
• scientific article; zbMATH DE number 2079017 (Why is no real title available?)
• scientific article; zbMATH DE number 944097 (Why is no real title available?)
• scientific article; zbMATH DE number 814800 (Why is no real title available?)
• Simple type-theoretic foundations for object-oriented programming

Cited in

(15)

• On the decidability of subtyping with bounded existential types and implementation constraints
• Basic theory of F-bounded quantification.
• Type destructors
• Foundations for virtual types
• Verified software units
• Two provably secure k-out-of-n oblivious transfer schemes
• A proposal for comparison of types in Pascal and associated semantic models
• Semantic types and approximation for Featherweight Java
• A CuCh interpretation of an object-oriented language
• A declarative framework for object-oriented programming with genetic inheritance
• A calculus with recursive types, record concatenation and subtyping
• System \(F^\mu_\omega\) with context-free session types
• Deconstructing general references via game semantics
• Type-directed operational semantics for gradual typing
• Recursive subtyping for all

Describes a project that uses

Uses Software

• Smalltalk
• BETA
• PolyTOIL
• Simula 67

This page was built for publication: Comparing object encodings.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854318)