Re: Universal grammar

haberg@xxxxxxxxxx (Hans Aberg) writes:

the first stepping stone are Prolog like programs. These
handle equations without bound variables (as quantifiers "all", "exist",
the Church "lambda" = function mapping "|->", etc.)

Free variables are implicitly "all"-quantified in Prolog.

Best wishes!
Markus Triska
.