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)

This 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}




www:

↑ © L. Allison, www.allisons.org/ll/   (or as otherwise indicated).
Created with "vi (Linux)",  charset=iso-8859-1,   fetched Tuesday, 07-Jul-2020 08:48:46 EDT.

Free: Linux, Ubuntu operating-sys, OpenOffice office-suite, The GIMP ~photoshop, Firefox web-browser, FlashBlock flash on/off.