from lambda to language and grammar

mpah@thegreen.co.uk
30 Nov 2005 17:28:19 -0500

          From comp.compilers

Related articles
from lambda to language and grammar mpah@thegreen.co.uk (2005-11-30)
| List of all articles for this month |

From: mpah@thegreen.co.uk
Newsgroups: comp.theory,comp.compilers
Date: 30 Nov 2005 17:28:19 -0500
Organization: http://groups.google.com
Keywords: theory, parse

It can now be shown that the rule system of the language machine
effectively contains the lambda calculus. Here are links to a
single-page summary of this finding and its implications, to the lambda
implementation itself, and also to a surprising discovery:


http://languagemachine.sourceforge.net/language_machine_outline.pdf
http://languagemachine.sourceforge.net/lambda.html
http://languagemachine.sourceforge.net/a_letter_to_Jonathan_Swift.pdf


The language machine is an efficient and directly usable toolkit for
language and grammar that is published as free software under the Gnu
GPL. At its core is an engine for applying unrestricted grammatical
substitution or rewriting rules.


Regards
Peri Hankey


--
http://languagemachine.sourceforge.net - The language machine



Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.