Categorical models of polymorphism

DOI10.1016/0890-5401(92)90024-AMaRDI QIDQ1193592zbMATH OpenFDO

Authors Andrea Asperti, Simone Martini

Publication date 27 September 1992

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

zbMATH Keywords

Cartesian closed categorieslambda-calculuscategorical modelsinternal categoriesindexed categoriesinternal modelsinternalizationPER modelinternal presheavesexternalizationGrothendieck completionhigher-order lambda-calculiinternal adjunctioninternal CCCPL- categoriesprovable retractionssemantics of functional programming

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 937388
• scientific article; zbMATH DE number 4027428
• Strong almost reducibility for analytic and Gevrey quasi-periodic cocycles
• Domain theoretic models of polymorphism
• scientific article; zbMATH DE number 4027427

Cites work

• scientific article; zbMATH DE number 3882404 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 4047723 (Why is no real title available?)
• scientific article; zbMATH DE number 4049849 (Why is no real title available?)
• scientific article; zbMATH DE number 4051567 (Why is no real title available?)
• scientific article; zbMATH DE number 49833 (Why is no real title available?)
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 3574077 (Why is no real title available?)
• scientific article; zbMATH DE number 3605078 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• scientific article; zbMATH DE number 3370546 (Why is no real title available?)
• A small complete category
• 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
• Recursion over realizability structures
• Retractions of dI-domains as a model for Type:Type
• The semantics of second-order lambda calculus
• The system \({\mathcal F}\) of variable types, fifteen years later

Cited in

(8)

• Term graph rewriting and garbage collection using opfibrations
• scientific article; zbMATH DE number 4059656 (Why is no real title available?)
• Feasibly categorical models
• scientific article; zbMATH DE number 4049849 (Why is no real title available?)
• Logical systems. I: Internal calculi.
• A full continuous model of polymorphism
• Comprehensive Parametric Polymorphism: Categorical Models and Type Theory
• Strong almost reducibility for analytic and Gevrey quasi-periodic cocycles

This page was built for publication: Categorical models of polymorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193592)