summaryrefslogtreecommitdiff
path: root/src/runtime/haskell
AgeCommit message (Collapse)Author
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
2010-10-02refactor the API for random generation again. Now PGF contains probabilities ↵krasimir
in the abstract syntax
2010-09-22the first revision of exhaustive and random generation with dependent types. ↵krasimir
Still not quite stable.
2010-09-22cleanup and export the Probabilistic API from PGFkrasimir
2010-09-12bugfix in PGF.Type.pType: Agda style types like {x : A} -> B should not be ↵krasimir
supported in GF
2010-08-30PGF.Expr.normalForm does variable renamingkrasimir
2010-08-09native representation for HOAS in PMCFG and incremental type checking of the ↵krasimir
parse forest
2010-08-24more advanced complete function in the PGFServicekrasimir
2010-07-31two new functions in the PGF API: mkAbs, unAbskrasimir
2010-07-31now the meta id of the meta variables is accessible via the PGF APIkrasimir
2010-07-31added function unType in PGFkrasimir
2010-07-15fix the algorithm for items cutting in the partial parserkrasimir
2010-07-13fix the loopchecking in PGF.Forest.bracketedToknkrasimir
2010-07-13bugfix in the decoding of literals in PGF.Binarykrasimir
2010-07-07report type errors in the shell from command "p"krasimir
2010-07-07simplify the monad TcMkrasimir
2010-07-01redesign the open-literals APIkrasimir
2010-06-30rename isLiteralFCat -> isPredefFId, fcat(String|Int|Float) -> ↵krasimir
fid(String|Int|Float)
generated by cgit v1.2.3 (git 2.39.1) at 2026-05-20 10:10:55 +0000