| Age | Commit message (Collapse) | Author |
|---|
|
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
from the API but for now I just hacked the C runtime
|
|
|
|
|
|
|
|
|
|
prediction
|
|
|
|
|
|
|
|
|
|
|
|
write Haskell bindings
|
|
|
|
completely loaded
|
|
|
|
function is linearizable in a given language. This is used in the Android UI for better vizualizations
|
|
write for instance 'ab.c' and then everything between the quites is identifier. This includes Unicode characters and non-ASCII symbols. This is useful for automatically generated GF grammars.
|
