Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
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.
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Thomas M. Cheng
IT Professional