| Age | Commit message (Collapse) | Author |
|---|
|
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
|
|
|
|
|
|
the pgf_evaluate_expr_thunk function. this ensures lazyness
|
|
|
|
|
|
a failing function will not crash
|
|
|
|
|
|
|
|
you try to use it
|
|
|
|
|
|
|
|
somehow did not push before
|
|
|
|
machines
|
|
accidentally. silence two harmless warnings
|
|
abstract syntax. there might be some bugs yet to be found, meta variables and computation under lambda is only partially supported
|
|
|
|
that now we can compute with lambda functions and with true tail recursion
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The def rules are now compiled to byte code by the compiler and then to
native code by the JIT compiler in the runtime. Not all constructions
are implemented yet. The partial implementation is now in the repository
but it is not activated by default since this requires changes in the
PGF format. I will enable it only after it is complete.
|
|
except those that require def rules. The design is consistent with the STG virtual machine
|
|
|
|
|
|
The configuration script takes significantly longer to run than the compilation
of all the C code, which is a hint that is in need of a major simplification.
|
|
|
|
|
|
|
|
|
|
|
