On Wed, Oct 11, 2006 at 11:04:49AM -0400, Robert Dockins wrote: > let q = seq q (FinCons 3 q) in q (beta) > > We have (from section 6.2): > seq _|_ y = _|_ > seq x y = y iff x /= _|_ > > Now, here we have an interesting dilemma.
The meaning of a recursive definition is the least fixed point of the equation, in this case _|_. Same as let x = x in x. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
