kr.angelov
|
b1e6a21c56
|
now (+) in the abstract syntax works, i.e. it knows how to deal with partial sums
|
2014-10-31 14:16:11 +00:00 |
|
kr.angelov
|
26ad164cec
|
finally proper stack unwind in the evaluator
|
2014-10-16 10:00:32 +00:00 |
|
kr.angelov
|
9c2f71b07a
|
now we statically allocate closures for all top-level functions and all nullary constructors. closures are dynamically allocated only for CAFs. this reduces memory use and time to allocate dynamic closures
|
2014-10-08 12:57:29 +00:00 |
|
kr.angelov
|
889c0f3df4
|
partial implementation for the FAIL instruction
|
2014-10-06 09:04:25 +00:00 |
|
kr.angelov
|
70455b88a7
|
bugfix in the gate evaluate_value_lambda
|
2014-09-30 08:42:06 +00:00 |
|
kr.angelov
|
14e6eec5ec
|
now a complete JIT compiler and ByteCode compiler for the def rules in the abstract syntax. there might be some bugs yet to be found, meta variables and computation under lambda is only partially supported
|
2014-09-25 10:35:06 +00:00 |
|
kr.angelov
|
621d748bac
|
a major revision of the bytecode generator and JIT compiler. the effect is that now we can compute with lambda functions and with true tail recursion
|
2014-09-11 15:39:39 +00:00 |
|
kr.angelov
|
4d28c7632e
|
the code for def rules now uses proper graph update to preserve lazyness
|
2014-09-05 11:53:02 +00:00 |
|
kr.angelov
|
cee5f590ca
|
added evaluator.h which I had forgoten
|
2014-08-29 08:36:53 +00:00 |
|