Categorical data types in parametric polymorphism

DOI10.1017/S0960129500000372zbMath0802.68083MaRDI QIDQ4286531

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

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

Related Items (12)

Types as parameters ⋮ The Girard-Reynolds isomorphism ⋮ The Girard-Reynolds isomorphism (second edition) ⋮ Proof Nets, Coends and the Yoneda Isomorphism ⋮ A domain-theoretic semantics of lax generic functions. ⋮ Leibniz equality is isomorphic to Martin-Löf identity, parametrically ⋮ Bifibrational functorial semantics of parametric polymorphism ⋮ Unnamed Item ⋮ Parametricity for primitive nested types ⋮ Strong categorical datatypes II: A term logic for categorical programming ⋮ The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type ⋮ The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus

Cites Work

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

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