Categorical data types in parametric polymorphism

DOI10.1017/S0960129500000372zbMATH Open0802.68083MaRDI QIDQ4286531FDOQ4286531

Authors: Ryu Hasegawa 

Publication date: 27 March 1994

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

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

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)

Cites Work

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

Cited In (20)

• Title not available (Why is that?)
• A logical aspect of parametric polymorphism
• A domain-theoretic semantics of lax generic functions.
• A representation theorem for second-order functionals
• Parametricity for primitive nested types
• Title not available (Why is that?)
• 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)
• Title not available (Why is that?)
• The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
• Bifibrational functorial semantics of parametric polymorphism
• Title not available (Why is that?)
• 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)