Lessons in Language Design II
All languages are basically lisp, which is basically a notational structure for lambda calculus. More like Chomsky’s universal grammar. 
Now the question is: what are the fundamental axioms and theoroms of lambda calculus that are necessary and in themselves sufficient for Turing completeness.
July 3rd, 2008 - Posted in Uncategorized | |