Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
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.
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Limin Hu
IEEE/ACM Transactions on Networking
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007