Tolga Güyer

Learn More
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(More)
This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions , and describes the properties of the duality principle on this model. With respect to this aim, some definitions and theorems which construct the model of the two-variable Lambda-Boolean functions are given. The simulation of the model is(More)
  • 1