Greetings,
1) How does one model "out of memory" condition in
Haskell, perhaps using a Maybe type?
2) Could you give an intutive description of data
construction, and how it relates to lamda calculus?
Thanks
Greetings,
Is identity function the only meaningful function
one can write without constraining the type variable using a typeclass? If not,
could you please give a counter-example?
Thanks
G'day all.
On Sun, Mar 02, 2003 at 10:18:13AM +0200, Cagdas Ozgenc wrote:
Is identity function the only meaningful function one can write
without constraining the type variable using a typeclass? If not,
could you please give a counter-example?
This might help:
@incollection{
On Sun, 2 Mar 2003 10:16:12 +0200
Cagdas Ozgenc [EMAIL PROTECTED] wrote:
Greetings,
1) How does one model out of memory condition in Haskell, perhaps using a Maybe
type?
Unfortuntely not since it would not be referentially transparent. It's
part of a more general issue of exceptions in
Cagdas Ozgenc [EMAIL PROTECTED] wrote:
Greetings,
Is identity function the only meaningful function one can write
without constraining the type variable using a typeclass? If not,
could you please give a counter-example?
Certainly you can write lots of ``meaningful function''s without type
