✦ LIBER ✦

The typed λ-calculus is not elementary recursive

✍ Scribed by Richard Statman

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 982 KB
Volume: 9
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(79)90007-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

General recursive functions in a very si

General recursive functions in a very simply interpretable typed λ-calculus

✍ G. Jacopini; G. Sontacchi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 526 KB

A semantic characterization of the well-

A semantic characterization of the well-typed formulae of λ-calculus

✍ Thomas Forster 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 901 KB

An upper bound for reduction sequences i

An upper bound for reduction sequences in the typed λ-calculus

✍ Helmut Schwichtenberg 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 205 KB

Semantics of the typed λ-calculus with s

Semantics of the typed λ-calculus with substitution in a cartesian closed category

✍ John W. Gray 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 994 KB

An implementation model of the typed λ-c

An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine

✍ Shinya Sato; Toru Sugimoto; Shinichi Yamada 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Not every finite lattice is embeddable i

Not every finite lattice is embeddable in the recursively enumerable degrees

✍ A.H Lachlan; R.I Soare 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 469 KB

## A certain lattice with eight elements is shown to be not embeddable as a lattice in the recursively enumerable degrees. This refutes the well-known Embedding Conjecture which asserted that every finite lattice could be so embedded.