Polymorphic lambda calculus and subtyping.

DOI10.1016/S0304-3975(00)00333-9zbMath1050.68023OpenAlexW1999499351MaRDI QIDQ1605176

Adrian Fiech, David A. Schmidt

Publication date: 15 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00333-9

zbMATH Keywords

PolymorphismSubtypingSecond-order lambda calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Unnamed Item
• The semantics of second-order lambda calculus
• A modest model of records, inheritance, and bounded quantification
• Inheritance as implicit coercion
• Algebraic domains of natural transformations
• Domain theoretic models of polymorphism
• An ideal model for recursive polymorphic types
• The Category-Theoretic Solution of Recursive Domain Equations