On functors expressible in the polymorphic typed lambda calculus

DOI10.1006/inco.1993.1037zbMath0785.03004OpenAlexW1998095216MaRDI QIDQ1260643

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (9)

The Girard-Reynolds isomorphism ⋮ A higher-order calculus and theory abstraction ⋮ On generalized algebraic theories and categories with families ⋮ The Girard-Reynolds isomorphism (second edition) ⋮ Types, abstraction, and parametric polymorphism, part 2 ⋮ A representation theorem for second-order functionals ⋮ Free \(\mu\)-lattices ⋮ Functorial polymorphism ⋮ Unnamed Item

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