Categorical data types in parametric polymorphism

DOI10.1017/S0960129500000372MaRDI QIDQ4286531zbMATH OpenFDO

Authors Ryu Hasegawa

Publication date 27 March 1994

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

zbMATH Keywords

second order lambda calculuscategorical data typesReynolds parametricity

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Abstract data types; algebraic specification (68Q65)

Recommendations

• Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
• scientific article; zbMATH DE number 742721
• Categorical models for Abadi and Plotkin's logic for parametricity
• Types, abstraction, and parametric polymorphism, part 2
• A note on categorical datatypes

Cites work

• A fixpoint theorem for complete categories
• A lattice-theoretical fixpoint theorem and its applications
• A small complete category
• Algebraic specification of data types: A synthetic approach
• Automatic synthesis of typed -programs on term algebras
• Categorical semantics for higher order polymorphic lambda calculus
• Domain theoretic models of polymorphism
• Extensional models for polymorphism
• Functorial polymorphism
• The Category-Theoretic Solution of Recursive Domain Equations
• The Expressiveness of Simple and Second-Order Type Structures
• The semantics of second-order lambda calculus
• The system \({\mathcal F}\) of variable types, fifteen years later

Cited in

(20)

• scientific article; zbMATH DE number 773983 (Why is no real title available?)
• A logical aspect of parametric polymorphism
• A domain-theoretic semantics of lax generic functions.
• Parametricity for primitive nested types
• A representation theorem for second-order functionals
• scientific article; zbMATH DE number 742721 (Why is no real title available?)
• Leibniz equality is isomorphic to Martin-Löf identity, parametrically
• Categorical models for Abadi and Plotkin's logic for parametricity
• The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type
• The Girard-Reynolds isomorphism (second edition)
• The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
• scientific article; zbMATH DE number 4111987 (Why is no real title available?)
• Bifibrational functorial semantics of parametric polymorphism
• scientific article; zbMATH DE number 7471683 (Why is no real title available?)
• The Girard-Reynolds isomorphism
• Proof nets, coends and the Yoneda isomorphism
• Types as parameters
• A note on categorical datatypes
• Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
• Strong categorical datatypes II: A term logic for categorical programming

This page was built for publication: Categorical data types in parametric polymorphism

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