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

DOI10.1016/J.AMC.2005.09.081MaRDI QIDQ2493750zbMATH OpenOpenAlexFDO

Authors Şeref Mirasyedioğlu, Tolga Güyer

Publication date 16 June 2006

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.6430

zbMATH Keywords

algebraic computationChurch-Rosser theoremlambda calculuslambda-Boolean reductionPrologsymbolic computation

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic programming (68N17) Grammars and rewriting systems (68Q42) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 799583
• A proof-theoretic treatment of \(\lambda \)-reduction with cut-elimination: \(\lambda \)-calculus as a logic programming language
• Transformational reducibility and synthesis of algorithms and programs of symbolic processing
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study
• Logic program synthesis as problem reduction using combining forms
• scientific article; zbMATH DE number 1950451
• Algebraic methods in the compositional analysis of logic programs
• scientific article; zbMATH DE number 2080337
• Term Rewriting and Applications

Cites work

• scientific article; zbMATH DE number 4070860 (Why is no real title available?)
• scientific article; zbMATH DE number 42778 (Why is no real title available?)
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(1)

• A functional computation model for the duality of two-variable lambda-Boolean functions

This page was built for publication: A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493750)