Mark P Jones comments:
...
> | > > Simon Peyton-Jones. The implementation of functional
> | > > programming languages. Prentice-Hall, 1987
...
> | This book is already on-line at
> |
> | http://research.microsoft.com/Users/simonpj/Papers/student.ps.gz
> That's a useful resource too, b
Hi David,
| >Recently, however, there has been some interest in using named instance
| >declarations in other ways, so perhaps we will see features like this
| >creeping into future versions of the language.
|
| In what kinds of ways? Sounds interesting.
I was thinking of a couple of papers fr
Hi Marcin,
| > There's no solid technical reason for this, but Haskell doesn't allow
| > it at the moment because there isn't an easy way to name an instance
| > declaration.
|
| There is another problem: even if we created a syntax to name them,
| if they would not be exported by default then c
| > Simon Peyton-Jones. The implementation of functional
| > programming languages. Prentice-Hall, 1987
|
| is this book could be made available online ? cos on amazon
| it seems out of print.
I'm planning to scan it in and make the copy available online.
In the next month or two.
Simo
David Feuer <[EMAIL PROTECTED]> writes:
> 1. Why can't [instances] be hidden in module imports/exports?
The way I see it, an instance declaration is an assertion that a
certain data type supports a certain set of operations. Thus, if the
data type and the operations on it are in scope, it make
On Mon, Dec 10, 2001 at 12:58:33AM -0800, Simon Peyton-Jones wrote:
> | > Simon Peyton-Jones. The implementation of functional
> | > programming languages. Prentice-Hall, 1987
> |
> | is this book could be made available online ? cos on amazon
> | it seems out of print.
>
> I'm planning
Hello!
On Sun, Dec 09, 2001 at 01:07:08PM +, Marcin 'Qrczak' Kowalczyk wrote:
> Fri, 7 Dec 2001 17:12:52 -0500 (EST), David Feuer <[EMAIL PROTECTED]> pisze:
> > I'm wondering why Haskell doesn't support Scheme-like cond statements
> > or a pattern matching predicate.
> I agree that both con
hi
i am new to haskell and am having a problem to write
function which takes a boolean expression and returns
a truthvalue stating whether or not it is a tautology.
Can anyone please help me??
Thanks a lot
uma
__
Do You Yahoo!?
Send your FREE ho
uma kompella wrote:
>
> hi
>
> i am new to haskell and am having a problem to write
> function which takes a boolean expression and returns
> a truthvalue stating whether or not it is a tautology.
>
> Can anyone please help me??
>
> Thanks a lot
> uma
I assume this is your homework. It is be
At 2001-12-10 16:07, uma kompella wrote:
>i am new to haskell and am having a problem to write
>function which takes a boolean expression and returns
>a truthvalue stating whether or not it is a tautology.
If you really want to impress your tutor, see if you can find a function
that does this i
10 matches
Mail list logo
