Bounded existentials and minimal typing

DOI10.1016/S0304-3975(96)00300-3zbMath0909.03017MaRDI QIDQ1127527

Giorgio Ghelli, Benjamin C. Pierce

Publication date: 13 August 1998

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

zbMATH Keywords

typed lambda-calculussubtypingbounded existential quantificationminimal type propertysecond-order bounded quantification

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (6)

Higher-order subtyping and its decidability ⋮ Type-specialized staged programming with process separation ⋮ Higher-order subtyping ⋮ On the decidability of subtyping with bounded existential types and implementation constraints ⋮ F-ing modules ⋮ Basic theory of \(F\)-bounded quantification.

Cites Work

• Unnamed Item
• Divergence of \(F_{\leq}\) type checking
• An extension of system \(F\) with subtyping
• Bounded quantification is undecidable
• Coherence of subsumption, minimum typing and type-checking in F ≤

This page was built for publication: Bounded existentials and minimal typing