A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG

This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Church

• Type: Journal
• Year: 2006
• Where: AMC
• Authors: Seref Mirasyedioglu, Tolga Güyer
• Keywords: AMC 2006, Efficient Logical Programming, Functional Computation Model, Lambda-beta Boolean Reduction