lambda ..

[Tril]

A lambda abstraction implicitly defines half of a substitution operation.
The lambda application defines the other half of what is needed to
complete substitution but still the fact that substitution is taking place
is implicit, in the lambda syntax.

This is unacceptable.  Every operation must be explicit.  How do you
implement lambda calculus using lambda calculus?  What if I want
abstractions to implicitly define other operations besides substitution?
If you can abstract ANY property, as you said in the web pages, Fare, why
must every property conform to a low-level "Search and replace" paradigm
of lambda?  Sure, maybe it's "complete" and therefore possible... that
doesn't mean it's easy for the programmer to do.

David Manifold <dem@tunes.org>