=
The (Interactive) Glasgow Haskell Compiler -- version 6.2.2
=
A Mac OS X double-clickable package is now available at:
http://www.uni-graz.at/imawww/haskell/GHC.6.2.2.
Peter Theissen wrote:
I´m progarmming a parser for functional programs. Now I want to
implement the infixL and infixR feature to increase the readability
of the code. I would be very glad if anyone can send me some
information about the implementation of this feature of the Haskell
parser or w
you can do:
case 4 of n
| (n==3) || (n==4) -> 99
Keean..
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
On 2004 October 22 Friday 12:15, Ben Rudiak-Gould wrote:
> Ryan Newton wrote:
> > [...]
> > case 3 of 3 -> 99; 4 -> 99
>
> You can do this:
>
>let rhs = (some complicated expression) in
>case 3 of
> 3 -> rhs
> 4 -> rhs
You can also do
case 3 of x | x `elem` [3,4] -> 99
though
Hi,
I´m progarmming a parser for functional programs. Now
I want to implement the infixL and infixR feature to increase
the readability of the code. I would be very glad if anyone
can send me some information about the implementation of
this feature of the Haskell parser or where I can find
someth
Ryan Newton wrote:
For example, in OCaml:
match 3 with 3 -> 99 | 4 -> 99
Can be abbreviated
match 3 with 3 | 4 -> 99
But I have had no luck figuring out how to do the same thing with:
case 3 of 3 -> 99; 4 -> 99
You can do this:
let rhs = (some complicated expression) in
case 3 of
3 ->
I'm baffled that I can't find anywhere in the documentation how to
associate two or more patterns with the same right-hand-side...
For example, in OCaml:
match 3 with 3 -> 99 | 4 -> 99
Can be abbreviated
match 3 with 3 | 4 -> 99
But I have had no luck figuring out how to do the same thing
---
Call for Papers
Formal Methods in System Design
Special Issue on
Parallel and Distributed Methods in Verification
(http:
