Programming",
Addison-Wesley, 1999 (ISBN 0-201-34275-8)
takes exactly this tack. It works very nicely.
--HR
--
Hamilton Richards Jr.Department of Computer Sciences
Senior Lecturer Ma
ell's syntax --to say nothing of its semantics-- is much
cleaner, much simpler, and much easier to learn.
--HR
--
Hamilton Richards Jr.Department of Computer Sciences
Senior Lecturer Mail Code C0500
512-471-9525 The University of Texas at Austin
SHC 434 Austin, Texas 78712-1188
[EMAIL PROTECTED]
--
agree with you less."
--HR
------
Hamilton Richards Jr.Department of Computer Sciences
Senior Lecturer Mail Code C0500
512-471-9525 The University of Texas at Austin
SHC 434 Austin, Texas 78712-1188
[EMAIL PROTECTED]
--
lines easy to read:
f >.> g >.> h >.> ...
--Ham
------
Hamilton Richards Jr.Department of Computer Sciences
Senior Lecturer Mail Code C0500
512-471-9525 The Univers
Richards Jr.Department of Computer Sciences
Senior Lecturer Mail Code C0500
512-471-9525 The University of Texas at Austin
SHC 434 Austin, Texas 78712-1188
[EMAIL PROTECTED]
--
: g
*** Expected type : a
*** Inferred type : _2
Yet if the inner type declaration is omitted:
> f :: a -> a
> f x = g
>where
>-- g :: a
>g = x
it compiles without a hitch.
Is there a simple explanation for this phenomenon?
Thanks,
--Ham
------
--
Hamilton Richards Jr.Department of Computer Sciences
Senior Lecturer Mail Code C0500
512-471-9525 The University of Texas at Austin
SHC 434 Austin, Texas 78712-1188
[EMAIL PROTECTED]
--