user-defined literals

11.7: adda/type"literals/symbol trees:

. most literals can be described abstractly

as symbol expressions:

literals are just given in english-symbol trees

and system sends the etree to the type'mgt,

who then has private ways of interpreting it .

. one of the things a type like that gives the system

is a literal-checking routine,

so then instead of enumerating the literals

with simple or branched enum's,

the compiler uses the literal-checking routine

during compile-time (vs the usual

where user routines are not available during compile-time) .

11.14: adda/type/modular literals:

. the type'face provides an etree description of

acceptable literals (a tall tree in

{ints, floats, strings, symbols})

. the type'body then has to provide

2 system-defined callback functions

that explain

how they want the etree literal represented as binary

and how to express its binary value back to etree .