Recursive subtyping for all
From MaRDI portal
Cites work
- A calculus with recursive types, record concatenation and subtyping
- A paradigmatic object-oriented programming language: Design, static typing and semantics
- A set of postulates for the foundation of logic.
- An extension of system \(F\) with subtyping
- Automatic synthesis of typed -programs on term algebras
- Basic theory of F-bounded quantification.
- Bounded quantification is undecidable
- Coherence of subsumption, minimum typing and type-checking in F ≤
- Comparing object encodings.
- Elaborating intersection and union types
- Engineering formal metatheory
- Functional Characters of Solvable Terms
- Higher-order subtyping
- scientific article; zbMATH DE number 1183236 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 512778 (Why is no real title available?)
- scientific article; zbMATH DE number 1377613 (Why is no real title available?)
- scientific article; zbMATH DE number 944097 (Why is no real title available?)
- Intersection and union types: Syntax and semantics
- Recursive programming with proofs
- Recursive subtyping revealed
- Simple type-theoretic foundations for object-oriented programming
- Subtyping recursion and parametric polymorphism in kernel Fun
- Type soundness proofs with definitional interpreters
- Types and programing languages
This page was built for publication: Recursive subtyping for all
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009019)