Received: from localhost ([::1]:42940 helo=stodi.digitalkingdom.org) by stodi.digitalkingdom.org with esmtp (Exim 4.76) (envelope-from ) id 1TQhJN-0004DF-SF; Tue, 23 Oct 2012 09:26:37 -0700 Received: from 173-13-139-235-sfba.hfc.comcastbusiness.net ([173.13.139.235]:35965 helo=digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.76) (envelope-from ) id 1TQhJC-0004D9-M5 for wikineurotic@lojban.org; Tue, 23 Oct 2012 09:26:36 -0700 Received: by digitalkingdom.org (sSMTP sendmail emulation); Tue, 23 Oct 2012 09:26:26 -0700 From: "Apache" Date: Tue, 23 Oct 2012 09:26:26 -0700 To: wikineurotic@lojban.org X-PHP-Originating-Script: 48:htmlMimeMail.php MIME-Version: 1.0 Message-ID: X-Spam-Score: 2.0 (++) X-Spam_score: 2.0 X-Spam_score_int: 20 X-Spam_bar: ++ X-Spam-Report: Spam detection software, running on the system "stodi.digitalkingdom.org", has identified this incoming email as possible spam. The original message has been attached to this so you can view it (if it isn't spam) or label similar future email. If you have any questions, see the administrator of that system for details. Content preview: The page lambda calculus was changed by zort at 12:26 EDT Comment: Removed natter. You can view the page by following this link: http://www.lojban.org/tiki/lambda%20calculus [...] Content analysis details: (2.0 points, 5.0 required) pts rule name description ---- ---------------------- -------------------------------------------------- 1.6 RCVD_IN_BRBL_LASTEXT RBL: RCVD_IN_BRBL_LASTEXT [173.13.139.235 listed in bb.barracudacentral.org] 0.4 RDNS_DYNAMIC Delivered to internal network by host with dynamic-looking rDNS Subject: [Wikineurotic] Wiki page lambda calculus changed by zort X-BeenThere: wikineurotic@lojban.org X-Mailman-Version: 2.1.14 Precedence: list Reply-To: webmaster@lojban.org List-Id: List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Errors-To: wikineurotic-bounces@lojban.org The page lambda calculus was changed by zort at 12:26 EDT Comment: Removed natter. You can view the page by following this link: http://www.lojban.org/tiki/lambda%20calculus You can view a diff back to the previous version by following this link: http://www.lojban.org/tiki/tiki-pagehistory.php?page=lambda%20calculus&compare=1&oldver=1&newver=2 *********************************************************** The changes in this version follow below, followed after by the current full page text. *********************************************************** +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ @@ -Lines: 4-11 changed to +Lines: 4-9 @@ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ ((John Cowan)) [http://balance.wiw.org/~jkominek/lojban/9411/msg00114.html|once explained lambda calculus], briefly, on the Lojban list. - *That's John Cowan, posting from Lojbab's mail account. Can you really imagine our wellbeloved Lojbab writing so perspicuously? -- ((And)) - ** Oops. --((Jay Kominek|jay)) ''fixed'' - http://users.info.unicaen.fr/~tlebarbe/Linguistics_Lexicon/ll_l.html#lambda-operator is a very brief discussion of lambda calculus as pertains to linguistics. + [http://users.info.unicaen.fr/~tlebarbe/Linguistics_Lexicon/ll_l.html#lambda-operator] is a very brief discussion of lambda calculus as pertains to linguistics. ---- +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ @@ -Lines: 15-20 changed to +Lines: 13-18 @@ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ In terms of programming, lambda calculus is very easy to explain. You know formal parameters and actual parameters? Well, the function with just the - formal parameters is a "lambda expression", and the formal parameters are
the "lambda variables": + formal parameters is a "lambda expression", and the formal parameters are
the "lambda variables": LAMBDA x . Factorial (x) +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ @@ -Lines: 43-47 changed to +Lines: 41-45 @@ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ guts of formal semantics (and of ((Computer Science))). But in itself, it's just like ((programming)) (precisely *because* it is the theoretical guts of - ((Computer Science)). ''actually it is merely one of 3(?) equally valid and equally powerful forms of computation --((Jay Kominek|j))'') + ((Computer Science)) (along with two(?) other equally valid and equally powerful forms of computation)) Now, if the above is *not* accessible to non-programmers, I guess I'm *********************************************************** The new page content follows below. *********************************************************** A [http://foldoc.doc.ic.ac.uk/foldoc/foldoc.cgi?query=lambda+calculus|definition] of lambda calculus. What looks to be a [http://www.csse.monash.edu.au/~lloyd/tildeFP/Lambda/Ch/|decent intro to lambda calculus]. ((John Cowan)) [http://balance.wiw.org/~jkominek/lojban/9411/msg00114.html|once explained lambda calculus], briefly, on the Lojban list. [http://users.info.unicaen.fr/~tlebarbe/Linguistics_Lexicon/ll_l.html#lambda-operator] is a very brief discussion of lambda calculus as pertains to linguistics. ---- Nick's stuff posted to the list: In terms of programming, lambda calculus is very easy to explain. You know formal parameters and actual parameters? Well, the function with just the formal parameters is a "lambda expression", and the formal parameters are the "lambda variables": LAMBDA x . Factorial (x) { Factorial = Factorial (x-1) * x } What's x? x is an empty slot, of course. Which gets filled by the actual value you call it with --- the actual parameter. Factorial(9). ce'u, it is claimed, corresponds to that lambda variable x. It's just a formal param, in programming terms. {ka} is a subroutine in the program that hasn't been called; it's just a piece of code, with no computed value. The minute you fill the value in (call the subroutine), it is further claimed, you no longer have an abstract piece of code, but something that's computed a value (true or false, in the Logic universe.) This turns {ka} with {ce'u} (something which isn't true or false) into {du'u} (something which is true or false.) Nothing with {ce'u} in it, I'd further claim, can be true or false. We've been talking about lambda calculus because that's the theoretical guts of formal semantics (and of ((Computer Science))). But in itself, it's just like ((programming)) (precisely *because* it is the theoretical guts of ((Computer Science)) (along with two(?) other equally valid and equally powerful forms of computation)) Now, if the above is *not* accessible to non-programmers, I guess I'm sorry; programmers and logician-linguists are the only people who are interested (OK, and some theoretical mathematicians.) So the tutorials online do tend to assume geekdom. Then again, Lojban tends to, too. :-) Er, hope this has helped. _______________________________________________ Wikineurotic mailing list Wikineurotic@lojban.org http://mail.lojban.org/mailman/listinfo/wikineurotic