kr.angelov
|
f421dd4c68
|
fix the debug mode in the reasoner
|
2014-10-23 08:15:12 +00:00 |
|
kr.angelov
|
57f7b61c6b
|
throw away the long obsolete runtime type information in the C runtime
|
2014-10-09 13:44:26 +00:00 |
|
kr.angelov
|
4ac5902fc9
|
replace the hash maps in the abstract syntax with binary search tables
|
2014-10-09 08:38:55 +00:00 |
|
kr.angelov
|
2f78333e28
|
GuString is now an ordinary C string - it makes live easier. In addition PgfSymbolKS, PgfExprFun and PgfLiteralStr now keep their strings as embedded flexible arrays. The latest change gives us the same compactness as the old representation but it is a lot easier to use.
|
2013-10-04 12:04:39 +00:00 |
|
kr.angelov
|
b08925fd3d
|
fixes in the C and Python API to make them closer to the Haskell API
|
2013-08-16 12:44:37 +00:00 |
|
kr.angelov
|
1b41792237
|
C runtime: fix the debug modes in the parser and in the reasoner after the changes in the printer
|
2013-06-27 11:00:26 +00:00 |
|
kr.angelov
|
c873531172
|
an optimization in the jitter for generating more compact code
|
2013-06-26 09:03:51 +00:00 |
|
kr.angelov
|
16584d4368
|
Now there is a just-in-time compiler which generates native code for proof search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec.
|
2013-06-25 19:22:42 +00:00 |
|
kr.angelov
|
f4cf8deab7
|
a trivial refactoring of the reasoner in the C runtime
|
2013-04-23 06:40:14 +00:00 |
|
kr.angelov
|
56c8f91d19
|
remove the pgf2yaml tool which was both broken and redundant. The declarations for generic programming from data.c are removed as well
|
2013-02-11 13:51:12 +00:00 |
|
kr.angelov
|
3be31c62e9
|
a new reasoner in the C runtime. It supports tabling which makes it decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
|
2013-01-07 12:50:32 +00:00 |
|
kr.angelov
|
32905c8363
|
debugging infrastructure in the reasoner
|
2012-12-14 21:25:00 +00:00 |
|
kr.angelov
|
5cec2d5a50
|
bugfix for the reasoner in the C runtime
|
2012-12-14 21:24:17 +00:00 |
|
kr.angelov
|
8aefd1e072
|
The first prototype for exhaustive generation in the C runtime. The trees are always listed in decreasing probability order. There is also an API for generation from Python
|
2012-12-14 15:32:49 +00:00 |
|