Lambda Calculus Fixed Point Operator Y (strict)

LA home
   Y (lazy)
   Y (strict)
   Thue seqs.
   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}


© L. Allison   (or as otherwise indicated),
Created with "vi (Linux or Solaris)",  charset=iso-8859-1,  fetched Monday, 19-Mar-2018 20:18:28 EDT.

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