Divergence of \(F_{\leq}\) type checking

DOI10.1016/0304-3975(94)00037-JzbMath0874.68031MaRDI QIDQ673966

Giorgio Ghelli

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

lambda calculussystem \(F_ \leq\)

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40)

Related Items (6)

Bounded existentials and minimal typing ⋮ Higher-order subtyping ⋮ Divergence of \(F_{\leq}\) type checking ⋮ Subtyping recursion and parametric polymorphism in kernel Fun ⋮ Basic theory of \(F\)-bounded quantification. ⋮ Comparing object encodings.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Divergence of \(F_{\leq}\) type checking
• A modest model of records, inheritance, and bounded quantification
• An extension of system \(F\) with subtyping
• Decidability and confluence of \(\beta\eta\text{top}_ \leqslant\) reduction in \({\mathbb{F}}_ \leqslant\)
• Bounded quantification is undecidable
• Operations on records
• Type theories and object-oriented programmimg
• Coherence of subsumption, minimum typing and type-checking in F ≤
• A paradigmatic object-oriented programming language: Design, static typing and semantics
• A semantic basis for Quest

This page was built for publication: Divergence of \(F_{\leq}\) type checking