Pure type systems with subtyping. (Extended abstract)

DOI10.1007/3-540-48959-2_27MaRDI QIDQ4263883zbMATH OpenFDO

Authors Jan Zwanenburg

Publication date 21 November 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48959-2_27

zbMATH Keywords

minimal typingpure type systems with subtypingsubject reductiontyping

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Pure subtype systems
• Subtyping dependent types
• An extension of system \(F\) with subtyping
• Pure type systems with explicit substitution

Cited in

(15)

• Dependent type system with subtyping I: Type level transitivity elimination
• Dependent types with subtyping and late-bound overloading
• Subtyping inheritance and its application in languages for symbolic computation systems
• Pure type systems with explicit substitution
• Automath type inclusion in Barendregt's cube
• scientific article; zbMATH DE number 1302055 (Why is no real title available?)
• System F with width-subtyping and record updating
• Pure Type Systems with de Bruijn Indices
• scientific article; zbMATH DE number 1870414 (Why is no real title available?)
• Automath and Pure Type Systems
• Relating Church-style and Curry-style subtyping
• Pure subtype systems
• Types for Proofs and Programs
• Typed homomorphic relations extended with subtypes
• A framework for substructural type systems

This page was built for publication: Pure type systems with subtyping. (Extended abstract)

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