Logical equivalence for subtyping object and recursive types
From MaRDI portal
Publication:2481559
Recommendations
Cites work
- A filter lambda model and the completeness of type assignment
- A modest model of records, inheritance, and bounded quantification
- Complete restrictions of the intersection type discipline
- Domain theory in logical form
- Full abstraction in the lazy lambda calculus
- scientific article; zbMATH DE number 1722661 (Why is no real title available?)
- scientific article; zbMATH DE number 46869 (Why is no real title available?)
- scientific article; zbMATH DE number 944097 (Why is no real title available?)
- Inheritance as implicit coercion
- Intersection type assignment systems
- Logical semantics for the first order -calculus.
- Recursion over realizability structures
- Semantics and logic of object calculi
- Theoretical Computer Science
Cited in
(9)- Operational equivalences for untyped and polymorphic object calculi
- Subtyping in logical form
- Approximation semantics and expressive predicate assignment for object-oriented programming (extended abstract)
- Structural subtyping for inductive types with functorial equality rules
- Semantic types and approximation for Featherweight Java
- scientific article; zbMATH DE number 1251179 (Why is no real title available?)
- Theoretical Computer Science
- Functional type assignment for Featherweight Java. To Rinus Plasmeijer, in honour of his 61st birthday
- Logical semantics for the first order -calculus.
This page was built for publication: Logical equivalence for subtyping object and recursive types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481559)