.png){kind=icon}
返回
A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2005.09.081.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Lambda calculus
Lambda-boolean
symbolic computation
algebraic computation
Church-Rosser theorem
prolog
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
.png){kind=icon}
