Subtyping in logical form

DOI10.1016/S1571-0661(04)80491-2MaRDI QIDQ2842836zbMATH OpenFDO

Authors Ugo de'Liguoro

Publication date 16 August 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(04)80491-2

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Logic of subtyping
• Logical equivalence for subtyping object and recursive types
• Logical forms, substitutions and information types
• scientific article; zbMATH DE number 1156716
• Type inference with subtypes
• Higher-order subtyping
• Subtyping constrained types
• scientific article; zbMATH DE number 4053610
• scientific article; zbMATH DE number 1175489

Cites work

• A filter lambda model and the completeness of type assignment
• A modest model of records, inheritance, and bounded quantification
• Domain theory in logical form
• scientific article; zbMATH DE number 1722661 (Why is no real title available?)
• scientific article; zbMATH DE number 944097 (Why is no real title available?)
• Recursion over realizability structures

Cited in

(2)

• Subformula Linking as an Interaction Method
• Logical forms, substitutions and information types

This page was built for publication: Subtyping in logical form

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