Semantics of the second order lambda calculus

DOI10.1017/S0960129500001341zbMath0751.03007OpenAlexW2107903102MaRDI QIDQ4006235

Bart Jacobs

Publication date: 26 September 1992

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

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

zbMATH Keywords

polymorphismcategoriesmodels of lambda calculussecond order \(\lambda\)-calculussemi-adjunctionssemi-functors

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

The HASCASL prologue: Categorical syntax and semantics of the partial \(\lambda\)-calculus ⋮ Logic of refinement types ⋮ CATEGORICAL MODEL CONSTRUCTION FOR PROVING SYNTACTIC PROPERTIES

Cites Work

• Unnamed Item
• The semantics of second-order lambda calculus
• Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
• The system \({\mathcal F}\) of variable types, fifteen years later
• Polymorphic type inference and containment
• A small complete category
• Domain theoretic models of polymorphism
• SYMMETRICAL HEYTING ALGEBRAS WITH OPERATORS
• Models of the lambda calculus
• Semantics for classical AUTOMATH and related systems
• An ideal model for recursive polymorphic types
• Categorical semantics for higher order polymorphic lambda calculus
• Data Types as Lattices

This page was built for publication: Semantics of the second order lambda calculus