Subtyping recursion and parametric polymorphism in kernel Fun

DOI10.1016/J.IC.2004.11.003zbMath1156.68331OpenAlexW1976571588MaRDI QIDQ1780453

Giorgio Ghelli, Dario Colazzo

Publication date: 13 June 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.11.003

zbMATH Keywords

SubtypingKernel FunRecursive typesType theory and type systems

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (3)

Typed path polymorphism ⋮ Type soundness for path polymorphism ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Divergence of \(F_{\leq}\) type checking
• Metric interpretations of infinite trees and semantics of non deterministic recursive programs
• An extension of system \(F\) with subtyping
• Bounded quantification is undecidable
• The subtyping problem for second-order types is undecidable.
• Edinburgh LCF. A mechanized logic of computation
• A lattice-theoretical fixpoint theorem and its applications
• Complexity of kernel Fun subtype checking
• Recursive subtyping revealed
• Type theories and object-oriented programmimg
• Coherence of subsumption, minimum typing and type-checking in F ≤
• Efficient recursive subtyping
• A semantic basis for Quest
• Compiling standard ML to Java bytecodes

This page was built for publication: Subtyping recursion and parametric polymorphism in kernel Fun