Combinatory weak reduction in lambda calculus

DOI10.1016/S0304-3975(97)00250-8zbMath0902.68116MaRDI QIDQ1129266

J. Roger Hindley, Naim Çağman

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items

Combinatory weak reduction in lambda calculus ⋮ Gödel's system \(\mathcal T\) revisited ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Normalization by Evaluation for Typed Weak lambda-Reduction ⋮ The Power of Closed Reduction Strategies

Cites Work

• Combinatory weak reduction in lambda calculus
• A mathematical logic without variables. II
• Combinatory Reductions and Lambda Reductions Compared
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatory weak reduction in lambda calculus