✦ LIBER ✦

On Functors Expressible in the Polymorphic Typed Lambda Calculus

✍ Scribed by J.C. Reynolds; G.D. Plotkin

Book ID: 112252037
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 900 KB
Volume: 105
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1993.1037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inhabitation of Types in the Simply Type

Inhabitation of Types in the Simply Typed Lambda Calculus

✍ W. Dekkers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Functions over free algebras definable i

Functions over free algebras definable in the simply typed lambda calculus

✍ Daniel Leivant 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 805 KB

Reducibility of types in typed lambda ca

Reducibility of types in typed lambda calculus: Comment on a paper by Richard Statman

✍ Wil Dekkers 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 218 KB

The converse principal type-scheme theor

The converse principal type-scheme theorem in lambda calculus

✍ Sachio Hirokawa 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 637 KB

A principal type-scheme of a A-term is the most general type-scheme for the term. The converse principal type-scheme theorem (J.R. Hindley, The principal typescheme of an object in combinatory logic, Trans. Amer. Math. Soe. 146 (1969) P9-60) states that every type-scheme of a combinatory term is a p

Inductive types and type constraints in

Inductive types and type constraints in the second-order lambda calculus

✍ Nax Paul Mendler 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 902 KB

[Lecture Notes in Computer Science] Type

[Lecture Notes in Computer Science] Typed Lambda Calculi and Applications Volume 4583 || Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo

✍ Della Rocca, Simona Ronchi 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 387 KB