summaryrefslogtreecommitdiff
path: root/src/runtime/haskell
AgeCommit message (Collapse)Author
2011-12-19the parser now use nub instead of nubsort which means that the abstract ↵kr.angelov
syntax trees will be returned lazily
2011-12-08Now graphvizAbstractTree suppress the visualization of implicit arguments.kr.angelov
2011-11-15now we store version number in every .gfo file. If the file is compiled with ↵kr.angelov
different compiler then we simply recompile it.
2011-11-10Now PMCFG is compiled per module and at the end we only link it. The new ↵kr.angelov
compilation schema is few times faster.
2011-10-25Preparations for release of GF 3.3hallgren
+ Changing version numbers and dates here and there. + Simplify build-binary-dist.sh since pgf-http need not be built anymore. + Use--gf-lib-path to make the sample grammars for minibar compile even if GF is not installed.
2011-10-20PGF.hs: Add LANGUAGE BangPatterns to make GHC 7.2 happyhallgren
Also remove oddly named function forExample (topological sorting) from export list.
2011-09-21fix in the proof search. when we start the generation from a template, we ↵kr.angelov
must start the refinement from the expression that the typecheker generated
2011-09-15added topological sort module to PGF - to be used in example based grammar ↵ra.monique
writing
2011-09-14quick fixes in PGF.TypeCheck suggested by Krasimir; to be revisitedaarne
2011-08-30bugfixes in the typechecker and the tree generatorkr.angelov
2011-08-30bugfix: allow higher-order variables in the linearizationkr.angelov
2011-08-29skip spaces before closing parenthesis in PGF.Expr.pFactoraarne
2011-08-28import command now gives priority to new abstract syntax, and discards the ↵aarne
old concretes if they are for the old abstract; the new priority is implemented in PGF.Data.unionPGF
2011-04-06avoid warning from ghc-7.0hallgren
Warning: -fglasgow-exts is deprecated: Use individual extensions instead
2011-04-06avoid warning from ghc-7.0hallgren
Warning: -fglasgow-exts is deprecated: Use individual extensions instead
2011-03-17Adding a missing file for the tokenizer...gdetrez
2011-02-10Adding a basic lexicon-based tokenizer and the asociated command in gf shellgdetrez
2011-02-06a simple clitic analysis command 'ca'aarne
2011-01-08fix the computation of abstract expressions in the presence of implicit ↵krasimir
arguments
2011-01-08bugfix in the handling of implicit arguments in the typecheckerkrasimir
2010-12-17bugfix: setProbabilities should be more robust when there are missing ↵krasimir
probabilities for some functions or categories
2010-12-14now every parse state keeps reference only to the concrete and the abstract ↵krasimir
syntaxes but not to the whole PGF
2010-12-14work-around in Tree.expr2tree to make Paraphrase workaarne
2010-12-14optimization in the parser for large lexicons. Now, the parser is slightly ↵krasimir
slower for grammars with a small lexicon but 3-4 times faster for the English Resource Grammar used in combination with Oxford Advanced Learners Dictionary
2010-10-19In the haskell code, we make the binary representation of the doubles ↵gdetrez
compliant with IEEE 754. The default binary representation in haskell's Data.Binary package is homemade and quite complicated. Making it compliant with IEEE 754 will make it easyer for the java runtimes (and probably others) to load the PGF.
2010-12-08fixed typos in the documentation for PGF.Parsekrasimir
2010-12-06simple refactoring in PGF.Macros and relatedkrasimir
2010-12-07moved PGF.ToApi to GF.Compile.ToAPIaarne
2010-12-06no more IO in the syntax to API translatorra.monique
2010-12-06vt -api with conversion to resource API namesaarne
2010-12-05added syntax to api translation modulera.monique
2010-11-24command ai in the shell now shows the probability of the treekrasimir
2010-11-12operations in the abstract syntaxkrasimir
2010-10-31added giza Alignments with command ga and merged the rendering algorithm for ↵ramona.enache
graphviz and giza alignments
2010-10-25when faced with hard unification problem the type checker should just ↵krasimir
postpone the decision instead of failing immediately. added test case as well
2010-10-25when we print the bracketed string it is useful to print the attached ↵krasimir
metavariables as well
2010-10-21change the TcM monad to continuation passing style. The old monad caused ↵krasimir
stack overflow for large search spaces
2010-10-21support for proof search with high-order functionskrasimir
2010-10-20bugfix in the term generationkrasimir
2010-10-20fixed typo which broke the parsing with -openclasskrasimir
2010-10-19in the type checker monad we should use lazy pattern matching because ↵krasimir
otherwise we force the exhaustive tree generation to be strict
2010-10-18added explicit depth parameter to the parsing API and the corresponding ↵krasimir
command in the shell
2010-10-18typo in PGF.TypeCheck which spoiled the previous patchkrasimir
2010-10-18now we use the GF reasoner to fillin meta variables in the abstract trees ↵krasimir
generated from the parser
2010-10-14now since the type checking monad TcM is nondeterministic we can use the ↵krasimir
same monad in PGF.Forest.getAbsTrees
2010-10-13bugfix in PGF.VisualizeTree for handling trees with implicit argumentskrasimir
2010-10-13fix PGF.Generate.restart. The restart should be done only if there are some ↵krasimir
solutions found
2010-10-11the exhaustive/random generator now knows how to handle computable functions ↵krasimir
in the types
2010-10-11now the generation from template with meta-variables respects the dependent ↵krasimir
types
2010-10-02backtracking for random generation is not enough. we must restart the search ↵krasimir
after each solution
generated by cgit v1.2.3 (git 2.39.1) at 2026-05-28 13:51:50 +0000