✦ LIBER ✦

Combinatory Reductions and Lambda Reductions Compared

✍ Scribed by Roger Hindley

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 632 KB
Volume: 23
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19770230708

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatory weak reduction in lambda cal

Combinatory weak reduction in lambda calculus

✍ Naim Çağman; J.Roger Hindley 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Demonstrating Lambda Calculus Reduction

✍ Peter Sestoft 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Reductions and quantization

✍ Ivailo M. Mladenov 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 531 KB

Efficient Combinatory Reduction

✍ John Staples 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 800 KB

Miura maps and reductions

✍ F. Guil 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Order-incompleteness and finite lambda r

Order-incompleteness and finite lambda reduction models

✍ Peter Selinger 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Many familiar models of the untyped lambda calculus are constructed by order-theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory of ÿ-or ÿÁ-conversion, the partial order i