✦ LIBER ✦

Comparing models of the intensional typed λ-calculus

✍ Scribed by R Hoofman

Book ID: 107948860
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 789 KB
Volume: 166
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00140-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Logical relations and the typed λ-calcul

Logical relations and the typed λ-calculus

✍ R. Statman 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 569 KB

The typed λ-calculus is not elementary r

The typed λ-calculus is not elementary recursive

✍ Richard Statman 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 982 KB

A Simply Typed λ-Calculus of Forward Aut

A Simply Typed λ-Calculus of Forward Automatic Differentiation

✍ Manzyuk, Oleksandr 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 278 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

Numeration Models of λ-Calculus

✍ Akira Kanda 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 644 KB

## XUMERATIOK MODELS OF A-CALCULUS by AKIRA KANDA in Vancouver (Canada)') ## 81. A-ealculns The A-calculus developed by CHURCH [2] is a formal system designed to study the equivalence of functions composed from other functions in certain primitive ways. In this section, we briefly overview this

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