File Release Notes and Changelog
Notes:
This release includes a translator and and runtime framework
to show that rules in the Language Machine can directly
represent and evaluate expressions in the Lambda Calculus.
There is also an example which shows how associative arrays
can be used to identify common stems, common subexpressions
and the like. Input can now be provided direct from the
command line, and completed right-side recursion levels are
now collapsed before new levels are started. Various bugs have been fixed.
Changes:
* Mon Nov 21 2005 Peri Hankey <mpah@users.sourceforge.net> 0.2.1-0ph
- lambda: translator and and evaluation framework for the lambda calculus
- stemming: use associative arrays for common stems and the like
- engine.d: exit from completed right-side before new right-side level
- fix obscure error in examination of values in variable binding
- engine.d: read after EOF should return EOF not crash
- application.d, element.d: -i for input from command line
- aibjaibj: a small exercise
