Conversation

Notices

1. clacke (clacke@social.heldscal.la)'s status on Thursday, 07-Dec-2017 02:43:35 EST clacke
   > In the end, we’ll have constructed a programming language out of the lambda calculus, and we’ll arrive at the factorial of 5 in the lambda calculus, as embedded in Python:
   
   > (((lambda f: (((f)((lambda f: ((lambda z: (((f)(((f)(((f)(((f)(((f)
   (z)))))))))))))))))))((((((lambda y: ((lambda F: (((F)((lambda x:
   (((((((y)(y)))(F)))(x)))))))))))((lambda y: ((lambda F: (((F)((lambda x:
   (((((((y)(y)))(F)))(x)))))))))))))((lambda f: ((lambda n: ((((((((((((
   lambda n: (((((n)((lambda _: ((lambda t: ((lambda f: (((f)((lambda void:
   (void)))))))))))))((lambda t: ((lambda f: (((t)((lambda void: (void)))))
   ))))))))((((((lambda n: ((lambda m: (((((m)((lambda n: ((lambda f:
   ((lambda z: (((((((n) ((lambda g: ((lambda h: (((h)(((g)(f)))))))))))
   ((lambda u: (z)))))((lambda u: (u)))))))))))))(n))))))) (n)))((lambda f:
   ((lambda z: (z)))))))))((lambda _: ((((lambda n: (((((n) ((lambda _: ((
   lambda t: ((lambda f: (((f)((lambda void: (void))))))))))))) ((lambda t:
   ((lambda f: (((t)((lambda void: (void))))))))))))) ((((((lambda n:
   ((lambda m: (((((m)((lambda n: ((lambda f: ((lambda z: (((((((n) ((lambda
   g: ((lambda h: (((h)(((g)(f)))))))))))((lambda u: (z)))))((lambda u:
   (u)))))))))))))(n)))))))((lambda f: ((lambda z: (z)))))))(n)))))))))
   ((lambda _: ((lambda t: ((lambda f: (((f)((lambda void: (void)))))))))))
   ))((lambda _: ((lambda f: ((lambda z: (((f)(z)))))))))))((lambda _: (((
   (((lambda n: ((lambda m: ((lambda f: ((lambda z: (((((m)(((n)(f)))))(z)
   ))))))))))(n)))(((f) ((((((lambda n: ((lambda m: (((((m)((lambda n:
   ((lambda f: ((lambda z: (((((((n) ((lambda g: ((lambda h: (((h)(((g)(f)
   ))))))))))((lambda u: (z)))))((lambda u: (u)))))))))))))(n)))))))(n)))
   ((lambda f: ((lambda z: (((f) (z))))))))))))))))))))))))(lambda x:x+1)(0)
   
   > Run the above in your Python interpreter. It’s equal to 120.
   
   And you wonder why people want to separate Church and state.
   
   http://matt.might.net/articles/python-church-y-combinator/
   1. clacke (clacke@social.heldscal.la)'s status on Thursday, 07-Dec-2017 03:32:34 EST clacke

      in reply to
      > In 1936, Alonzo Church created a method for defining functions called the λ-calculus. Within λ-calculus, he defined an encoding of the natural numbers called the Church numerals. A function on the natural numbers is called λ-computable if the corresponding function on the Church numerals can be represented by a term of the λ-calculus.
      
      What were you doing when you were 33 years old?
      
      I bet you weren't founding *half of the field of computability as we know it*.
      
      https://en.wikipedia.org/wiki/Alonzo_Church
   2. kat (kat@quitter.se)'s status on Friday, 08-Dec-2017 06:33:22 EST kat

      in reply to
      @clacke and there is the numeral 5  https://quitter.se/attachment/4965063