| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2017-04-19 | explicitly classify all functions in libpgf as either internal or API functions | krasimir | |
| 2017-04-12 | a patch from Bjørnar Luteberget for compatibility with MSVC | krasimir | |
| 2016-04-14 | fix in evaluator.c | krasimir | |
| 2015-07-03 | merge the states for reasoning and evaluation into a single structure | krasimir | |
| 2014-10-31 | now (+) in the abstract syntax works, i.e. it knows how to deal with partial ↵ | kr.angelov | |
| sums | |||
| 2014-10-16 | finally proper stack unwind in the evaluator | kr.angelov | |
| 2014-10-09 | replace the hash maps in the abstract syntax with binary search tables | kr.angelov | |
| 2014-10-08 | now we statically allocate closures for all top-level functions and all ↵ | kr.angelov | |
| nullary constructors. closures are dynamically allocated only for CAFs. this reduces memory use and time to allocate dynamic closures | |||
| 2014-10-07 | the indirection should be done in the evaluate_expr_thunk gate instead of in ↵ | kr.angelov | |
| the pgf_evaluate_expr_thunk function. this ensures lazyness | |||
| 2014-10-06 | partial implementation for the FAIL instruction | kr.angelov | |
| 2014-09-30 | bugfix in pgf_evaluate_expr_thunk | kr.angelov | |
| 2014-09-30 | fix pgf_value2expr for partial applications | kr.angelov | |
| 2014-09-30 | bugfix in the gate evaluate_value_lambda | kr.angelov | |
| 2014-09-25 | now a complete JIT compiler and ByteCode compiler for the def rules in the ↵ | kr.angelov | |
| abstract syntax. there might be some bugs yet to be found, meta variables and computation under lambda is only partially supported | |||
| 2014-09-11 | a major revision of the bytecode generator and JIT compiler. the effect is ↵ | kr.angelov | |
| that now we can compute with lambda functions and with true tail recursion | |||
| 2014-09-05 | the code for def rules now uses proper graph update to preserve lazyness | kr.angelov | |
| 2014-08-11 | pattern matching in def rules is now supported | kr.angelov | |
| 2014-08-11 | a partial support for def rules in the C runtime | kr.angelov | |
| 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. | |||
| 2014-07-08 | implemented computing with abstract syntax trees. It passes all test cases ↵ | kr.angelov | |
| except those that require def rules. The design is consistent with the STG virtual machine | |||
