Domain theoretic models of polymorphism

DOI10.1016/0890-5401(89)90068-0MaRDI QIDQ1824612zbMATH OpenOpenAlexFDO

Authors Thierry Coquand, Glynn Winskel, Carl A. Gunter

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0890-5401(89)90068-0

zbMATH Keywords

polymorphismScott domainsindexed categorycontinuous sectionscategory-theoretic model for polymorphic lambda- calculusGrothendieck fibrations

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Recommendations

• scientific article; zbMATH DE number 4027427
• scientific article; zbMATH DE number 517052
• scientific article; zbMATH DE number 937388
• Domain-theoretical models of parametric polymorphism
• scientific article; zbMATH DE number 4027428

Cites work

• scientific article; zbMATH DE number 3882403 (Why is no real title available?)
• scientific article; zbMATH DE number 3882404 (Why is no real title available?)
• scientific article; zbMATH DE number 3858394 (Why is no real title available?)
• scientific article; zbMATH DE number 3825806 (Why is no real title available?)
• scientific article; zbMATH DE number 4027427 (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 4050971 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 3783068 (Why is no real title available?)
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 3594646 (Why is no real title available?)
• An ideal model for recursive polymorphic types
• Effectively given domains
• The Category-Theoretic Solution of Recursive Domain Equations
• The independence of Peano's fourth axiom from Martin-Löf's type theory without universes
• The largest Cartesian closed category of domains
• The system \({\mathcal F}\) of variable types, fifteen years later
• Universal profinite domains

Cited in

(42)

• Semantics of the second order lambda calculus
• A domain-theoretic semantics of lax generic functions.
• scientific article; zbMATH DE number 2102746 (Why is no real title available?)
• A domain model characterising strong normalisation
• scientific article; zbMATH DE number 4050971 (Why is no real title available?)
• A higher-order calculus and theory abstraction
• Some reasons for generalising domain theory
• The dependent product construction in various categories of domains
• scientific article; zbMATH DE number 4027427 (Why is no real title available?)
• scientific article; zbMATH DE number 4035777 (Why is no real title available?)
• Categorical models of polymorphism
• Alpha conversion, conditions on variables and categorical logic
• Some economic applications of Scott domains
• Domain interpretations of Martin-Löf's partial type theory
• A natural semantics of first-order type dependency
• Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
• Polymorphic lambda calculus and subtyping.
• scientific article; zbMATH DE number 517052 (Why is no real title available?)
• The semantics of second-order lambda calculus
• Recursion over realizability structures
• Building continuous webbed models for system F
• Extensional models for polymorphism
• Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
• A full continuous model of polymorphism
• Models for polymorphism over physical dimension
• Computer Science Logic
• Adequacy for a lazy functional language with recursive and polymorphic types
• Types, abstraction, and parametric polymorphism, part 2
• An adequacy theorem for dependent type theory
• Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
• An algebraic approach to stable domains
• Term graph rewriting and garbage collection using opfibrations
• scientific article; zbMATH DE number 4154448 (Why is no real title available?)
• Polymorphism and the obstinate circularity of second order logic: a victims' tale
• Quantitative domains and infinitary algebras
• From parametric polymorphism to models of polymorphic FPC
• scientific article; zbMATH DE number 1531357 (Why is no real title available?)
• Categorical data types in parametric polymorphism
• The shuffle Hopf algebra and noncommutative full completeness
• Domain-theoretical models of parametric polymorphism
• Inheritance as implicit coercion
• Functorial polymorphism

This page was built for publication: Domain theoretic models of polymorphism

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