On 2/17/2020 12:12 PM, Lawrence Bottorff wrote:
I found these blowing down the sidewalk today
; TRUE = λx.λy.x
(define mytrue
(lambda (t) (lambda (f) t)))
and
; FALSE = λx.λy.y
(define myfalse
(lambda (t) (lambda (f) f)))
Two problems, I don't understand them and AFAICT, they don't work. I
traced them back to this
<https://stackoverflow.com/questions/40288602/the-code-of-the-build-in-scheme-procedure-pair>
post on stackoverflow. Can anyone get me started here?
LB
In addition to Ricardo's good answer:
The definition of TRUE above is one of the combinators of the S-K-I
combinator calculus, which is a simple to understand subset of the
untyped lambda calculus. Programs in S-K-I are expressed as sequences
of 3 simple combinators, and computation is done by repeated expansion,
application and reduction until an irreducible form - the result - is
reached.
https://en.wikipedia.org/wiki/SKI_combinator_calculus
George
--
You received this message because you are subscribed to the Google Groups "Racket
Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-users+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/racket-users/56ba86fe-c379-3127-d8b2-ba70078380e2%40comcast.net.
