Intersection types and bounded polymorphism

DOI10.1017/S096012959600223XzbMath0873.03020OpenAlexW2014351883MaRDI QIDQ4340497

Benjamin C. Pierce

Publication date: 9 October 1997

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096012959600223x

zbMATH Keywords

subtypingtypecheckingsecond-order typed \(\lambda\)-calculus with bounded quantification and intersection types

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Non-local configuration of component interfaces by constraint satisfaction ⋮ Basic theory of \(F\)-bounded quantification.

This page was built for publication: Intersection types and bounded polymorphism