Robert C. Durbeck
IEEE TACON
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.
Robert C. Durbeck
IEEE TACON
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Yigal Hoffner, Simon Field, et al.
EDOC 2004
John M. Boyer, Charles F. Wiecha
DocEng 2009