On functors expressible in the polymorphic typed lambda calculus

DOI10.1006/INCO.1993.1037zbMATH Open0785.03004OpenAlexW1998095216MaRDI QIDQ1260643FDOQ1260643

Authors: John C. Reynolds, Gordon D. Plotkin 

Publication date: 30 August 1993

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

Full work available at URL: https://semanticscholar.org/paper/3397551bd817a057149c4fb0230fd01cce2327f2

Recommendations

• scientific article; zbMATH DE number 3882404
• Initial algebra semantics for lambda calculi
• scientific article; zbMATH DE number 4027428
• scientific article
• Domain theoretic models of polymorphism

zbMATH Keywords

Cartesian closed categorypolymorphic typed lambda calculusweak initial \(T\)-algebra

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Cited In (14)

• Title not available (Why is that?)
• Types, abstraction, and parametric polymorphism, part 2
• Polymorphic lambda calculus with context-free session types
• A representation theorem for second-order functionals
• Polymorphic lambda calculus and subtyping.
• The Girard-Reynolds isomorphism (second edition)
• Bifibrational functorial semantics of parametric polymorphism
• Title not available (Why is that?)
• The Girard-Reynolds isomorphism
• Free \(\mu\)-lattices
• On generalized algebraic theories and categories with families
• Title not available (Why is that?)
• A higher-order calculus and theory abstraction
• Functorial polymorphism

This page was built for publication: On functors expressible in the polymorphic typed lambda calculus

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