✦ LIBER ✦

Combinatory weak reduction in lambda calculus

✍ Scribed by Naim Çağman; J.Roger Hindley

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 519 KB
Volume: 198
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00250-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Demonstrating Lambda Calculus Reduction

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

Combinatory Reductions and Lambda Reduct

Combinatory Reductions and Lambda Reductions Compared

✍ Roger Hindley 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 632 KB

Expressing combinatory reduction systems

Expressing combinatory reduction systems derivations in the rewriting calculus

✍ Clara Bertolissi; Horatiu Cirstea; Claude Kirchner 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 755 KB

The discrimination theorem holds for com

The discrimination theorem holds for combinatory weak reduction

✍ R. Hindley 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Predicate calculus and naive set theory

Predicate calculus and naive set theory in pure combinatory logic

✍ Bunder, M. W. 📂 Article 📅 1981 🏛 Springer-Verlag ⚖ 394 KB

Full Intersection Types and Topologies i

Full Intersection Types and Topologies in Lambda Calculus

✍ Silvia Ghilezan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Topologies are introduced on the set of lambda terms by their typeability in the full intersection type assignment system. These topologies give rise to simple proofs of some fundamental results of the lambda calculus such as the continuity theorem and the genericity lemma. We show that application