Re: [Haskell-cafe] Lazy evaluation and tail-recursion

[Tillmann Rendel]

Hi,

Daniel Fischer wrote:
Let's look at the following code:
    countdown n = if n == 0 then 0 else foo (n - 1)

s/foo/countdown/

presumably


    if' c t e = if c then t else e
    countdown' n = if' (n == 0) 0 (foo (n - 1))

s/foo/countdown'/

Yes to both substitutions. Looks like I need an email client with ghc 
integration.

  Tillmann

_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe