A sequent calculus for subtyping polymorphic types

DOI10.1007/3-540-61550-4_144MaRDI QIDQ4375803zbMATH OpenFDO

Authors Jerzy Tiuryn

Publication date 8 February 1998

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

Full work available at URL https://doi.org/10.1007/3-540-61550-4_144

zbMATH Keywords

coherencecut eliminationdecidabilitynatural deductionsemanticssequent calculussubject reductionsubtyping polymorphic typestype reconstruction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Cut-elimination and normal-form theorems (03F05)

Recommendations

• A sequent calculus for subtyping polymorphic types
• scientific article; zbMATH DE number 1799515
• Subtyping calculus of construction. (Extended abstract)
• Coherence and transitivity of subtyping as entailment
• Logic of subtyping

Cited in

(13)

• Polymorphic lambda calculus and subtyping.
• Subtyping recursion and parametric polymorphism in kernel Fun
• A sequent calculus for subtyping polymorphic types
• Logic of subtyping
• Structural subtyping for inductive types with functorial equality rules
• Predicative polymorphic subtyping
• Coherence and transitivity of subtyping as entailment
• A calculus with polymorphic and polyvariant flow types
• A delegation-based object calculus with subtyping
• Type-base flow analysis
• Pragmatic subtyping in polymorphic languages
• Programming Languages and Systems
• Typed homomorphic relations extended with subtypes

This page was built for publication: A sequent calculus for subtyping polymorphic types

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