Lambda Calculus Fixed Point Operator Y (strict)

LA home
Computing
FP
 λ-calc.
  Intro
  Syntax
  Examples
   Ints
   Bools
   Lists(1)
   arithmetic
   Y (lazy)
   Y (strict)
   Lists(2)
   Trees
   Primes(1)
   Fibonacci(1)
   Unique
   Hamming#s
   Composites
   Fibonacci(2)
   Thue seqs.
   Edit-dist.
   Y (strict)

The strict version of Y works with a strict interpreter (the lazy one will not). You can program this Y in many conventional languages such as Algol-68.

let F = lambda f. lambda n. if n=0 then 1 else n*f(n-1),

    Y = lambda G.
        let Ggg = lambda g. lambda n. G(g g)n
        in  Ggg Ggg

in Y F 10

{\fB Strict Version of Y. \fP}

NB. The applet above needs Java on.
 
www

free:
Linux operating-sys
OpenOffice office-suite, ver. 3.1+
The GIMP ~photoshop
Firefox web browser
FlashBlock flash on/off

© L. Allison   http://www.allisons.org/ll/   (or as otherwise indicated),
Created with "vi (Linux + Solaris)",  charset=iso-8859-1,  fetched Wednesday, 17-Mar-2010 00:20:00 EST.