Bugs item #1276246, was opened at 2005-08-30 02:48
Message generated for change (Comment added) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1276246group_id=8032
Please note that this message will contain a full copy of the comment
Bugs item #1276115, was opened at 2005-08-29 22:17
Message generated for change (Settings changed) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1276115group_id=8032
Please note that this message will contain a full copy of the comment
Bugs item #1274506, was opened at 2005-08-27 08:29
Message generated for change (Comment added) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1274506group_id=8032
Please note that this message will contain a full copy of the comment
Hi, i hope this is a bug.
Please look at the file Mult.hs
and function: startM1 (17-20)
run this function for different inputs (orignially, multiply (1%7) with
(0%2)) try to run with : (1%3) and (0%1)
(2%3) and (0%1)
(1%2) and (0%1)
Bugs item #1277023, was opened at 2005-08-30 17:19
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1277023group_id=8032
Please note that this message will contain a full copy of
On Tuesday 30 August 2005 06:32, [EMAIL PROTECTED] wrote:
Benjamin Franksen wrote:
On Thursday 25 August 2005 19:58, Udo Stenzel wrote:
[...] you'll need a type signature somewhere to help ghc resolve
the overloading of newArray and readArray, which is surprisingly
tricky due to the s
You can check them out using CVS as follows:
cvs -d:pserver:[EMAIL PROTECTED]:/data/cvs-rep login
cvs -d:pserver:[EMAIL PROTECTED]:/data/cvs-rep checkout uust
I'll ask Doaitse to add this information to the web page.
Arthur
On 30-aug-05, at 13:53, Benjamin Franksen wrote:
On Tuesday 30
Am Dienstag, 30. August 2005 12:12 schrieben Sie:
Wolfgang [and Phil]
As others have noted, Moggi had the key idea of using monads to support
the semantics of programming languages. Wadler was clearly the first to
have the amazing insight that monads could be a *programming* idiom too,
and
Am Dienstag, 30. August 2005 13:13 schrieb Bayley, Alistair:
[...]
I was also wondering what the disadvantages of monadic style are? Are there
compiler optimisations which are not possible with monadic code?
State or StateT are monads which are implemented using ordinary pure Haskell.
So,
Michael Vanier [EMAIL PROTECTED] writes:
Right now, the Debian unstable package for GHC 6.4 won't install due to
some conflict with libgmp3 (the package maintainer has been notified).
The trick to getting this to work is to install the libgmp3 from
stable.
apt-get install libgmp3/stable #or
From: Martin Vlk [mailto:[EMAIL PROTECTED]
http://www-i2.informatik.rwth-aachen.de/Staff/Current/michaelw/sttt-ml-haske
ll.pdf
This quote from the paper resonated with me:
Also, if
imperative elements of a given application were not taken
into account during its design but turn out to be
From: Cale Gibbard [mailto:[EMAIL PROTECTED]
Well, here's an attempt at a start on a similar mechanism for Haskell:
-- (start Packet.hs)
module Packet where
import Data.Bits
import Data.Word
class Packet a where
readPacket :: [Word8] - (a, [Word8])
...
There's a
Erlang does this nicely, I replied to the LtU thread. I positively
got the impression that nobody was parsing binary data in Haskell ;).
On Aug 30, 2005, at 12:29 PM, Bayley, Alistair wrote:
There's a request on LtU for a similar ability (somewhat wider in
scope,
perhaps):
On Tue, Aug 30, 2005 at 12:41:20PM +0200, Joel Reymont wrote:
Erlang does this nicely, I replied to the LtU thread. I positively
got the impression that nobody was parsing binary data in Haskell ;).
I am doing this quite often, I apologize for not sharing my experience
and promise to improve
Can I beg for examples?
On Aug 30, 2005, at 1:29 PM, Tomasz Zielonka wrote:
BTW, if efficiency is not a primary concern, Parsec can be quite nice
for decoding binary messages of many protocols.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Tue, 30 Aug 2005, Tomasz Zielonka wrote:
On Tue, Aug 30, 2005 at 12:41:20PM +0200, Joel Reymont wrote:
Erlang does this nicely, I replied to the LtU thread. I positively
got the impression that nobody was parsing binary data in Haskell ;).
I am doing this quite often, I apologize for not
On Aug 30, 2005, at 12:13 PM, Bayley, Alistair wrote:From: Duncan Coutts [mailto:[EMAIL PROTECTED]] This is often a misconception, that just because you find you need to'do' something in the middle of your algorithm, that you need to convert it wholly to monadic style. Yes. However, Wadler makes a
There seems to be a misconception in this thread
that there is something non-functional or
imperative about using monads.
That is simply not true. When what you are trying
to write is most naturally and clearly expressed
as a series of steps - there is no reason not to
use a monad.
Even when a
Hi,
Basically, i have several rules:
f1 x y ...
f2 x y ...
.
They are all of the same type, but different names because i'll later on
launch one thread for each of them, i.e:
forkIO (f1 x y)
forkIO (f2 x y)
.
There maybe
On 8/30/05, Dinh Tien Tuan Anh [EMAIL PROTECTED] wrote:
Hi,
Basically, i have several rules:
f1 x y ...
f2 x y ...
.
They are all of the same type, but different names because i'll later on
launch one thread for each of them, i.e:
forkIO (f1
On 8/30/05, Dinh Tien Tuan Anh [EMAIL PROTECTED] wrote:
Hi,
Basically, i have several rules:
f1 x y ...
f2 x y ...
.
They are all of the same type, but different names because i'll later on
launch one thread for each of them, i.e:
forkIO (f1
Joel Reymont wrote,
Can I beg for examples?
I've been using parsec for binary parsing (Java class files in my case)
as a first exercise with both Haskell and combinator parsing, with a
view to applying same to network protocols.
The experience has been surprisingly pleasant. In particular, it
On 8/30/05, Sebastian Sylvan [EMAIL PROTECTED] wrote:
On 8/30/05, Dinh Tien Tuan Anh [EMAIL PROTECTED] wrote:
Hi,
Basically, i have several rules:
f1 x y ...
f2 x y ...
.
They are all of the same type, but different names because i'll later on
There is no inherent advantage or disadvantage
to monads. If the idea is most clearly expressed
as a monad, use a monad. If the idea is most
clearly expressed recursively, write it recursively
(but perhaps wrap it in return).
Perhaps the inherent disadvantage is that functions written in the
On 31/08/2005, at 7:37 AM, Miles Sabin wrote:
I've been using parsec for binary parsing (Java class files in my
case)
as a first exercise with both Haskell and combinator parsing, with a
view to applying same to network protocols.
I've also been experimenting with using Parsec to parse
Perhaps you could write _everything_ in monadic style, and then derive
the non-monadic version by running it on an empty state monad. But
then if everything was already monadic you wouldn't need the non-monadic
version.. :)
...
Perhaps the inherent disadvantage is that functions written
On Mon, Aug 29, 2005 at 01:08:31AM +0200, Joel Reymont wrote:
Alistair,
Thanks alot for your examples. I still have one unanswered question...
How would you read a tuple of values (24, GID, Seq) like in my Erlang
example, where 24 is one byte, GID is a 4-byte integer and Seq is a 2-
On Tue, Aug 30, 2005 at 12:35:30PM +0100, Philippa Cowderoy wrote:
On Tue, 30 Aug 2005, Tomasz Zielonka wrote:
On Tue, Aug 30, 2005 at 12:41:20PM +0200, Joel Reymont wrote:
Erlang does this nicely, I replied to the LtU thread. I positively
got the impression that nobody was parsing binary
On Tue, Aug 30, 2005 at 12:55:55PM +0200, Henning Thielemann wrote:
The disadvantage of pure functional code is certainly the danger of being
forced to rewrite it to monadic code in the future. But there is a big
advantage of pure functional code: It gives the guarantee about data
dependencies
29 matches
Mail list logo
