| Age | Commit message (Collapse) | Author |
|
|
|
|
|
point operations.
|
|
|
|
|
|
|
|
BIND token which means that the App grammar was running about 2-3 times slower.
|
|
|
|
|
|
sums
|
|
|
|
|
|
explicit assertions
|
|
|
|
|
|
|
|
everything works even when the compiler's optimizations are off
|
|
|
|
|
|
the parser's speed
|
|
|
|
|
|
|
|
|
|
in Haskell.
|
|
|
|
|
|
|
|
|
|
|
|
variables. The type checker generates fresh indices
|
|
|
|
|
|
|
|
|
|
abstract syntax
|
|
|
|
|
|
Haskell runtime but will be intepreted in the C runtime
|
|
|
|
|
|
|
|
|
|
|
|
|
|
libgu
|
|
|
|
|
|
nullary constructors. closures are dynamically allocated only for CAFs. this reduces memory use and time to allocate dynamic closures
|
|
|