Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
A list-oriented extension of the type-free lambda-calculus is considered where lists have a unique applicative property. This property is related to the combining form of construction in Backus's functional programming system called FP. We express this property in our system by two extra reduction rules, which we call γ-rules. Our extension helps reducing the gap between type-free lambda-calculus and high-level functional languages. The main purpose of this paper is to prove the consistency of this extended lambda-calculus by showing that it satisfies the Church-Rosser theorem. © 1992.
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Hendrik F. Hamann
InterPACK 2013