[<<][staapl][>>][..]
Mon Mar 30 14:40:52 CEST 2009

names in concatenative language

What I still don't fully get is how to treat names in a concatenative
language in a localized way.  It has been quite clear to me for a
while that names should _only_ reflect functions, not values.  It's
possible to construct complete static reasoning based on functions
alone with values (i.e. numbers and stacks) being restricted to the
run time only.

But then.. What is a number?  In lambda calculus it can be modeled by
a function..  This remark is more about binding forms.  I.e. with the
``|'' word used in macros names get bound to values (actually constant
functions), though there was the doubt for a while to support a
different binding form that did not perform this form of automatic
abstraction.



[Reply][About]
[<<][staapl][>>][..]