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

Mirasyedioglu S., Guyer T.

APPLIED MATHEMATICS AND COMPUTATION, vol.176, no.1, pp.65-75, 2006 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 176 Issue: 1
  • Publication Date: 2006
  • Doi Number: 10.1016/j.amc.2005.09.081
  • Journal Name: APPLIED MATHEMATICS AND COMPUTATION
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.65-75
  • Keywords: Lambda calculus, Lambda-boolean, symbolic computation, algebraic computation, Church-Rosser theorem, prolog
  • Gazi University Affiliated: Yes

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. (c) 2005 Elsevier Inc. All rights reserved.