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

Mirasyedioglu S., Guyer T.

APPLIED MATHEMATICS AND COMPUTATION, cilt.176, sa.1, ss.65-75, 2006 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 176 Sayı: 1
  • Basım Tarihi: 2006
  • Doi Numarası: 10.1016/j.amc.2005.09.081
  • Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.65-75
  • Anahtar Kelimeler: Lambda calculus, Lambda-boolean, symbolic computation, algebraic computation, Church-Rosser theorem, prolog
  • Gazi Üniversitesi Adresli: Evet

Özet

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.