[Haskell-cafe] Finite but not fixed length...

Jason Dusek jason.dusek at gmail.com
Wed Oct 13 03:57:25 EDT 2010

  Is there a way to write a Haskell data structure that is
  necessarily only one or two or seventeen items long; but
  that is nonetheless statically guaranteed to be of finite

Jason Dusek
Linux User #510144 | http://counter.li.org/

More information about the Haskell-Cafe mailing list