✦ LIBER ✦

Strong Reduction and Normal Form in Combinatory Logic

✍ Scribed by Bruce Lercher

Book ID: 124959741
Publisher: Association for Symbolic Logic
Year: 1967
Tongue: English
Weight: 875 KB
Volume: 32
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2271659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong Reduction and Normal Form in Comb

Strong Reduction and Normal Form in Combinatory Logicby Bruce Lercher

✍ Review by: Luis E. Sanchis 📂 Article 📅 1971 🏛 Association for Symbolic Logic 🌐 English ⚖ 225 KB

Axioms for Strong Reduction in Combinato

Axioms for Strong Reduction in Combinatory Logic

✍ Roger Hindley 📂 Article 📅 1967 🏛 Association for Symbolic Logic 🌐 English ⚖ 900 KB

On pseudo-cβnormal form in combinatory l

On pseudo-cβnormal form in combinatory logic

✍ Mohamed Mezghiche 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 1005 KB

The search for a reduction in combinator

The search for a reduction in combinatory logic equivalent to -reduction

✍ Jonathan P. Seldin 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 269 KB

A Normal form Theorem for Recursive Oper

A Normal form Theorem for Recursive Operators in Iterative Combinatory Spaces

✍ D. Skordev 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

A XORMAL FORM THEOREM FOR RECURSIVE OPERATORS Lemma 2. All elements of 9 ? and the element I are perfect. If E and rj are perfect elements of 9, then (t, q ) is also perfect. Proof. Obvious from the definition. L e m m a 3. Let [ be a perfect element of 9. Then Vp(L(p7, [) = 9 & R ( [ . y ) = 9).

A solution to Curry and Hindley’s proble

A solution to Curry and Hindley’s problem on combinatory strong reduction

✍ Pierluigi Minari 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 333 KB