Categorical models of polymorphism

DOI10.1016/0890-5401(92)90024-AzbMath0772.18007MaRDI QIDQ1193592

Simone Martini, Andrea Asperti

Publication date: 27 September 1992

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Cartesian closed categoriescategorical modelsinternal categorieslambda-calculusinternalizationindexed categoriesinternal modelsPER modelinternal presheavesexternalizationGrothendieck completionhigher-order lambda-calculiinternal adjunctioninternal CCCPL- categoriesprovable retractionssemantics of functional programming

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Term graph rewriting and garbage collection using opfibrations

Cites Work

• The semantics of second-order lambda calculus
• Retractions of dI-domains as a model for Type:Type
• The system \({\mathcal F}\) of variable types, fifteen years later
• A small complete category
• Recursion over realizability structures
• Categorical semantics for higher order polymorphic lambda calculus
• Constructive natural deduction and its ‘ω-set’ interpretation
• On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrine models and vice-versa
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Categorical models of polymorphism