Highly simplified, with dynamically loaded standard context.
Comment in value.h
Simplify type routines by returning 0 until arg count is reached.  The eval
routine promotes the type of the left side into the parent automatically.  This
simplifies a lot of code and makes a stress test about 18% faster.
Add an eval to resolve_sym in the undefined symbol case.  Otherwise it only
reports the first undefined symbol and then halts with a type error.  This is a
consequence of my recent simplification, which no longer uses separate types
type_item, type_item1, and type_item2.
Far better evaluation method which handles repeatable side effects better.
Simplified handling of generic data, e.g. in fprint.  Don't need the meta-
inspection functions "look" and "type".
Just before rework = == ===
Lambda expression now uses = == and =\ for normal, eager, and recursive.
Can now call parse_stream from a Fexl program.
.
Eliminate "=\" syntax for recursive definitions.  Instead, we use the "@"
(fixpoint) operator explicitly, which suggests a sort of label for looping.
Add a built-in "use" function to facilitate modularity.
Working on a cleaner more powerful "use" function.
About to try direct _compare functions, instead of _cmp and order functions.
Using direct _compare functions, instead of _cmp and order functions.

Compressing code using generic routines such as replace_compare, replace_long2,
etc.
About to try centralized replace technique.
Merging in some changes from try branch.
.
.
.