Talk:Simply typed lambda calculus

From Wikipedia, the free encyclopedia

You have new messages (last change).

I started this page, since STL is a central formalism in Theoretical Computer Science. I hope it didn't get too mathematical. I still have to complete the references, if sb else wants to lend a hand, you are very welcome. --Thorsten 21:07, 4 Jun 2005 (UTC)

This is very useful, however, I'm not a mathematician and I don't exactly know what a closed term is and this expression is used twice on the page in places that seem to be important. If I have some time myself I might be able to look it up and fix it but maybe it's easy to be done by someone else. --RiedelCastro 03:45, 1 September 2006 (UTC)

I tried to address this by adding closed terms, i.e. terms typable in the empty context,. I don't know whether this is enough, one could write a whole article about free and bound variables which don't just show up in lambda calculus but also in predicate logic, etc. Maybe there is one already somewhere and we should refer to it? --Thorsten 21:39, 28 September 2006 (UTC)

Retrieved from "http://en.wikipedia.org../../../s/i/m/Talk%7ESimply_typed_lambda_calculus_0dc4.html"