| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4636898 | Applied Mathematics and Computation | 2006 | 11 Pages |
Abstract
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-Rosser properties and functional computation model in symbolic and algebraic computation with induction. The algorithm which improved for Lambda-Beta Boolean reduction is simulated by the efficient logical programming language Prolog.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Åeref MirasyedioÄlu, Tolga Güyer,