| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2017-04-05 | added generateOntology & generateOntologyDepth | krasimir | |
| 2013-11-05 | Eliminate mutual dependencies between the GF compiler and the PGF library | hallgren | |
| + References to modules under src/compiler have been eliminated from the PGF library (under src/runtime/haskell). Only two functions had to be moved (from GF.Data.Utilities to PGF.Utilities) to make this possible, other apparent dependencies turned out to be vacuous. + In gf.cabal, the GF executable no longer directly depends on the PGF library source directory, but only on the exposed library modules. This means that there is less duplication in gf.cabal and that the 30 modules in the PGF library will no longer be compiled twice while building GF. To make this possible, additional PGF library modules have been exposed, even though they should probably be considered for internal use only. They could be collected in a PGF.Internal module, or marked as "unstable", to make this explicit. + Also, by using the -fwarn-unused-imports flag, ~220 redundant imports were found and removed, reducing the total number of imports by ~15%. | |||
| 2013-01-29 | Avoid crash in random generation with probabilities | hallgren | |
| 2011-08-30 | bugfixes in the typechecker and the tree generator | kr.angelov | |
| 2010-11-12 | operations in the abstract syntax | krasimir | |
| 2010-10-21 | change the TcM monad to continuation passing style. The old monad caused ↵ | krasimir | |
| stack overflow for large search spaces | |||
| 2010-10-21 | support for proof search with high-order functions | krasimir | |
| 2010-10-20 | bugfix in the term generation | krasimir | |
| 2010-10-18 | now we use the GF reasoner to fillin meta variables in the abstract trees ↵ | krasimir | |
| generated from the parser | |||
| 2010-10-14 | now since the type checking monad TcM is nondeterministic we can use the ↵ | krasimir | |
| same monad in PGF.Forest.getAbsTrees | |||
| 2010-10-13 | fix PGF.Generate.restart. The restart should be done only if there are some ↵ | krasimir | |
| solutions found | |||
| 2010-10-11 | the exhaustive/random generator now knows how to handle computable functions ↵ | krasimir | |
| in the types | |||
| 2010-10-11 | now the generation from template with meta-variables respects the dependent ↵ | krasimir | |
| types | |||
| 2010-10-02 | backtracking for random generation is not enough. we must restart the search ↵ | krasimir | |
| after each solution | |||
| 2010-10-02 | refactor the API for random generation again. Now PGF contains probabilities ↵ | krasimir | |
| in the abstract syntax | |||
| 2010-09-22 | the first revision of exhaustive and random generation with dependent types. ↵ | krasimir | |
| Still not quite stable. | |||
| 2010-05-06 | fixed two bugs in gt | aarne | |
| 2010-02-02 | gr for several metas fixed ; commented out one alternative in SammieGer to ↵ | aarne | |
| make it compile | |||
| 2010-02-01 | commands mq and tq can take a tree with metas to guide generation | aarne | |
| 2010-01-30 | gt and gr can start from a tree with metavariables, just filling them | aarne | |
| 2010-01-26 | bug fixes in biased generation ; example probs file in lib/src | aarne | |
| 2010-01-26 | added probabilities to trees and random gen; not yet in shell | aarne | |
| 2009-12-13 | reorganize the directories under src, and rescue the JavaScript interpreter ↵ | krasimir | |
| from deprecated | |||
