gf-core.git/src/GF/Compile/GFCCtoProlog.hs, branch master Unnamed repository; edit this file 'description' to name the repository. https://git.adelon.net/gf-core.git/atom?h=master 2009-12-13T18:50:29+00:00 reorganize the directories under src, and rescue the JavaScript interpreter from deprecated 2009-12-13T18:50:29+00:00 krasimir krasimir@chalmers.se 2009-12-13T18:50:29+00:00 urn:sha1:f85232947e74ee7ef8c7b0ad2338212e7e68f1be change the data types and the syntax in PGF to match the new syntax for implict arguments 2009-09-20T11:43:41+00:00 krasimir krasimir@chalmers.se 2009-09-20T11:43:41+00:00 urn:sha1:b1a51f46f5d137ab4d65a4381b349af3291a944d polish the PGF API and make Expr and Type abstract types. Tree is a type synonym of Expr 2009-09-11T13:45:34+00:00 krasimir krasimir@chalmers.se 2009-09-11T13:45:34+00:00 urn:sha1:1cdf171251a56baf0867b65a95c9bd59801ff912 hopefully complete and correct typechecker in PGF 2009-09-06T20:31:52+00:00 krasimir krasimir@chalmers.se 2009-09-06T20:31:52+00:00 urn:sha1:b97d6abb8190cdcb595b9bf48051cc4a98f01156 PGF.Type.Hypo now can represent explicit and implicit arguments and argument without bound variable 2009-07-05T15:44:52+00:00 krasimir krasimir@chalmers.se 2009-07-05T15:44:52+00:00 urn:sha1:279ff9a6d28c87e1a6c105d9d33df2511fb8f132 some work on evaluation with abstract expressions in PGF 2009-05-22T18:54:51+00:00 krasimir krasimir@chalmers.se 2009-05-22T18:54:51+00:00 urn:sha1:41b263cf6aa38e7c6ef090c0fa18949b86eec62c refactor the PGF.Expr type and the evaluation of abstract expressions 2009-05-20T21:03:56+00:00 krasimir krasimir@chalmers.se 2009-05-20T21:03:56+00:00 urn:sha1:7db4b641ce6abe90dd404459cd5eccb6e67f618c Fix in Prolog output of the atom "'" 2008-11-17T13:33:53+00:00 peb peb@ling.gu.se 2008-11-17T13:33:53+00:00 urn:sha1:7babe205e8f1c77afdc9a3c7cb7e859298999b42 Changes to the prolog output format 2008-09-25T07:32:39+00:00 peb peb@ling.gu.se 2008-09-25T07:32:39+00:00 urn:sha1:b5ae83f899f280e5af9e19d36e1492780e2718b7 new PGF output format: prolog syntax 2008-09-03T09:04:09+00:00 peb peb@ling.gu.se 2008-09-03T09:04:09+00:00 urn:sha1:74826158cbe6ad87c0cdfaef7814820c547a3306 * output a PGF grammar in prolog readable syntax * variables in abstract syntax (hypotheses and lambda-abstractions) are translated to unique logical variables * PGF terms in concrete syntax are translated to more prolog-like terms