|from lambda to language and grammar email@example.com (2005-11-30)|
|Date:||30 Nov 2005 17:28:19 -0500|
|Posted-Date:||30 Nov 2005 17:28:19 EST|
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:
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.
http://languagemachine.sourceforge.net - The language machine
Return to the
Search the comp.compilers archives again.