gf-core.git/src/runtime/haskell/PGF/Generate.hs, branch optimize Unnamed repository; edit this file 'description' to name the repository. https://git.adelon.net/gf-core.git/atom?h=optimize 2017-04-05T11:08:31+00:00 added generateOntology & generateOntologyDepth 2017-04-05T11:08:31+00:00 krasimir krasimir@chalmers.se 2017-04-05T11:08:31+00:00 urn:sha1:20a038719f4813d513087b214946d5b84a25a72c Eliminate mutual dependencies between the GF compiler and the PGF library 2013-11-05T13:11:10+00:00 hallgren hallgren@chalmers.se 2013-11-05T13:11:10+00:00 urn:sha1:3814841d7d3b77b3f033cb98c1c0a04ac39435d7 + 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%. Avoid crash in random generation with probabilities 2013-01-29T13:59:20+00:00 hallgren hallgren@chalmers.se 2013-01-29T13:59:20+00:00 urn:sha1:211cd9bb25c7928b94976a9b8bb1124a0578b59e bugfixes in the typechecker and the tree generator 2011-08-30T11:24:59+00:00 kr.angelov kr.angelov@gmail.com 2011-08-30T11:24:59+00:00 urn:sha1:4215fc31bf9bfc949599697a014dc13a112ed47c operations in the abstract syntax 2010-11-12T19:37:19+00:00 krasimir krasimir@chalmers.se 2010-11-12T19:37:19+00:00 urn:sha1:115b4213d515ce308568fd71e362f6ce2881fb50 change the TcM monad to continuation passing style. The old monad caused stack overflow for large search spaces 2010-10-21T15:01:52+00:00 krasimir krasimir@chalmers.se 2010-10-21T15:01:52+00:00 urn:sha1:822a70cf7a5971cc9d60239f98243bc1a07e12a5 support for proof search with high-order functions 2010-10-21T12:47:26+00:00 krasimir krasimir@chalmers.se 2010-10-21T12:47:26+00:00 urn:sha1:82edf7bebb62dffb0386f5d78b6871e2523b49e4 bugfix in the term generation 2010-10-20T13:36:39+00:00 krasimir krasimir@chalmers.se 2010-10-20T13:36:39+00:00 urn:sha1:2991b7acefd84c62eb305f3d13afc34b401b7527 now we use the GF reasoner to fillin meta variables in the abstract trees generated from the parser 2010-10-18T15:55:14+00:00 krasimir krasimir@chalmers.se 2010-10-18T15:55:14+00:00 urn:sha1:702b4aad3b7862c445a22a05de9fef6e3f44576c now since the type checking monad TcM is nondeterministic we can use the same monad in PGF.Forest.getAbsTrees 2010-10-14T14:28:40+00:00 krasimir krasimir@chalmers.se 2010-10-14T14:28:40+00:00 urn:sha1:05a52d693799425918f2663b4406d9a24dd8ad9e