gf-core.git - Unnamed repository; edit this file 'description' to name the repository.

Age	Commit message (Collapse)	Author
2014-10-23	fix the debug mode in the reasoner	kr.angelov

2014-10-09	throw away the long obsolete runtime type information in the C runtime	kr.angelov

2014-10-09	replace the hash maps in the abstract syntax with binary search tables	kr.angelov

2013-10-04	GuString is now an ordinary C string - it makes live easier. In addition ↵	kr.angelov
	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-08-16	fixes in the C and Python API to make them closer to the Haskell API	kr.angelov

2013-06-27	C runtime: fix the debug modes in the parser and in the reasoner after the ↵	kr.angelov
	changes in the printer
2013-06-26	an optimization in the jitter for generating more compact code	kr.angelov

2013-06-25	Now there is a just-in-time compiler which generates native code for proof ↵	kr.angelov
	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-04-23	a trivial refactoring of the reasoner in the C runtime	kr.angelov

2013-02-11	remove the pgf2yaml tool which was both broken and redundant. The ↵	kr.angelov
	declarations for generic programming from data.c are removed as well
2013-01-07	a new reasoner in the C runtime. It supports tabling which makes it ↵	kr.angelov
	decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
2012-12-14	debugging infrastructure in the reasoner	kr.angelov

2012-12-14	bugfix for the reasoner in the C runtime	kr.angelov

2012-12-14	The first prototype for exhaustive generation in the C runtime. The trees ↵	kr.angelov
	are always listed in decreasing probability order. There is also an API for generation from Python