Good point. I've done this. (Ian, could you merge)
Fri Nov 12 08:30:52 GMT 2010 simo...@microsoft.com
* Allow the old [$foo| ... |] syntax for quasi-quotes
This is just a backward-compatibility thing, to be removed
eventually.
Simon
| -Original Message-
| From:
On Thursday 11 November 2010 9:23:13 pm Luke Palmer wrote:
Admittedly, the class of reasoning I usually use in my Haskell
programs, and the one that you talked about using earlier this
message, is essentially seq doesn't exist. However, I prefer to use
this class of reasoning because I would
Hi Karel,
I think is your cabal too old
BTW, i suggest install GHC-6.12.3 with gtk2hs-0.12.0 and manatee.
-- Andy
Karel Gardas karel.gar...@centrum.cz writes:
On 11/12/10 04:37, Andy Stewart wrote:
Hi all,
I have write Simple Manual at http://haskell.org/haskellwiki/Manatee
Enjoy!
C. McCann c...@uptoisomorphism.net writes:
This was my first thought as well! However, reading to/from a file
would of course be in IO, at which point you'd be free to read the
file back in through normal means to get at the representation. So in
that respect, this is equivalent to (a - b) -
On Thu, Nov 11, 2010 at 10:28 PM, Dan Doel dan.d...@gmail.com wrote:
On Thursday 11 November 2010 12:34:21 pm John Lato wrote:
I think the only way this would work would be if you consider functions
to
be equal only to themselves, i.e. x+x and 2*x are not equal. That's
not a trade-off I
Message: 3
Date: Thu, 11 Nov 2010 18:56:00 +0100
From: Sjoerd Visscher sjo...@w3future.com
On Nov 11, 2010, at 6:34 PM, John Lato wrote:
I don't know to what extent it would apply in this hypothetical
situation, but ghc (and probably other compilers) rely upon Haskell's
semantics in
David Fox dds...@gmail.com writes:
I would hesitate to call it a terrible decision unless I had a good
idea of what the ratio of Java programmers to Haskell programmers was
out in the world. Just sayin...
I'm not sure the ratio is very interesting, presumably they only need
one or at most a
On 11/11/10 21:34, Luke Palmer wrote:
On Thu, Nov 11, 2010 at 3:13 AM, Richard Seningtonsc06...@leeds.ac.uk wrote:
I got hold of, and looked through the paper suggested in the root of this
thread “Pseudo random trees in Monte-Carlo, and based upon this
I have thrown together a version of
Thank you very much. I was dreading the thought of figuring out some
CPP hack to accomplish this, and applying it across my codebase. Much
appreciated!
MIchael
On Fri, Nov 12, 2010 at 10:38 AM, Simon Peyton-Jones
simo...@microsoft.com wrote:
Good point. I've done this. (Ian, could you merge)
Hello,
I recently tried to
cabal install plugins
on a windows box and it failed with the following error:
Resolving dependencies...
Downloading plugins-1.5.1.4...
Configuring plugins-1.5.1.4...
cabal: The package has a './configure' script. This requires a Unix
compatibility toolchain such as
On Fri, 12 Nov 2010 08:38:24 +, Simon Peyton-Jones simo...@microsoft.com
wrote:
Good point. I've done this. (Ian, could you merge)
Thank you very much for this! I was afraid to see so much code broken as well
as Michael.
Best regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
On Thu, Nov 11, 2010 at 9:07 PM, Andy Stewart lazycat.mana...@gmail.comwrote:
David Leimbach leim...@gmail.com writes:
Wow!
Is this just for Linux or is anyone able to run it on Mac OS X?
I don't know whether can work on Mac.
I design it for Linux.
Fair enough, it's a great
Hi Jason,
Sorry for the delayed response. Thanks for pointing out the darcs-benchmark
package. I had not seen that before and there may be some room for sharing
infrastructure. Parsing the runtime stats is pretty easy, but comparing
different runs, computing statistics, and generating tables
This isn't about the plugin functionality, it's about compiling code.
As the message says :
This requires a Unix compatibility toolchain such as MinGW+MSYS or
Cygwin.
You'll find that you need such a toolchain to compile much open source
software, including many Haskell modules, on Windows.
On Fri, Nov 12, 2010 at 4:24 AM, Ketil Malde ke...@malde.org wrote:
IMO, it's morally different, you're now operating on a file, and you
shouldn't rely on the contents being predictable. You can make the
sin-bin argument that IO can do anything, but I think there's a moral
distinction between
Hello Kevin,
Thanks. I understand that this is a toolchain issue, I just got used
to the nice feeling of having 'cabal install foo' works seamlessly and
flawlessly to get me some magic piece of software :-) I will try to be
more patient and try to setup a proper toolchain for installing
plugins
On Thu, 11 Nov 2010, Dan Doel wrote:
intensional equality: two values are provably equal if they evaluate to the
same normal form
extensional equality: this incorporates non-computational rules, like the
point-wise equality of functions.
Now, in a type theory where equality is
Hi, I was playing with the following example I found in D.A.Turner's
paper Total Functional Programming:
data Bad a = C (Bad a - a)
bad1 :: Bad a - a
bad1 b@(C f) = f b
bad2 :: a
bad2 = bad1 (C bad1)
To my surprise, instead of creating a bottom valued function (an
infinite loop), I
On Nov 12, 2010, at 10:40 AM, rocon...@theorem.ca wrote:
[1]Actaully the realizer for serialize is *weaker* that this
axioms. The realizer for serialize would be (Nat - Nat) - IO Nat
instead of (Nat - Nat) - Nat, so should have less impact that the
Church-Turing axiom.
I don't see
On Fri, Nov 12, 2010 at 07:52:53PM +0100, Petr Pudlak wrote:
Hi, I was playing with the following example I found in D.A.Turner's
paper Total Functional Programming:
data Bad a = C (Bad a - a)
bad1 :: Bad a - a
bad1 b@(C f) = f b
bad2 :: a
bad2 = bad1 (C bad1)
To my surprise, instead of
See http://www.haskell.org/pipermail/haskell/2006-September/018497.html
On Fri, 12 Nov 2010, Petr Pudlak wrote:
On Fri, Nov 12, 2010 at 07:52:53PM +0100, Petr Pudlak wrote:
Hi, I was playing with the following example I found in D.A.Turner's paper
Total Functional Programming:
data Bad a =
Il 12/11/2010 19:01, Kevin Jardine ha scritto:
This isn't about the plugin functionality, it's about compiling code.
As the message says :
This requires a Unix compatibility toolchain such as MinGW+MSYS or
Cygwin.
Is it really necessary to use autoconf?
I have read the autoconf.ac file
I use Hint for the same purpose. It has been tested under windows
2010/11/12 Arnaud Bailly arnaud.oq...@gmail.com
Hello Kevin,
Thanks. I understand that this is a toolchain issue, I just got used
to the nice feeling of having 'cabal install foo' works seamlessly and
flawlessly to get me some
On 11/11/2010 04:12 PM, Simon Marlow wrote:
On 04/11/2010 22:38, Lennart Augustsson wrote:
The smallest Haskell I know of is Gofer/Hugs; it originally ran on a
640k PCs.
Before that languages like SASL and KRC ran on PDP-11 with 64k memory.
None of these had a compiler that was bootstrapped,
On 11/11/2010 08:43 PM, Richard O'Keefe wrote:
If length, map, and so on had always been part of a Sequence
typeclass, people would not now be talking about
We have a winner...
It's always puzzled me that Haskell's standard containers almost
completely lack any way to use them
On 11/11/2010 11:48 PM, John Lask wrote:
again quoting
http://research.microsoft.com/en-us/um/people/simonpj/Haskell/records.html
Haskell lacks a serious record system. (The existing mechanism for
named fields in data types was always seen as a stop-gap measure.)
isn't it about time this
On 12 Nov 2010, at 20:21, Andrew Coppin wrote:
On 11/11/2010 08:43 PM, Richard O'Keefe wrote:
If length, map, and so on had always been part of a Sequence
typeclass, people would not now be talking about
It's always puzzled me that Haskell's standard containers almost
completely lack any
On Fri, Nov 12, 2010 at 3:33 AM, Richard Senington sc06...@leeds.ac.uk wrote:
In short, I am worried by the properties of this random number generator. I
propose improving the testing system, and then posting both the test suite
and this random generator to
Hackage, unless you really want it
On 11/11/2010 08:07 PM, C. McCann wrote:
Having a full serialization function without some restriction along
those lines would be like renaming unsafePerformIO to runIO, moving it
to Control.Monad.IO, and telling people hey, just don't misuse this
and everything will be okay.
There's been a
On 12/11/2010 08:33 PM, Malcolm Wallace wrote:
On 12 Nov 2010, at 20:21, Andrew Coppin wrote:
It's always puzzled me that Haskell's standard containers almost
completely lack any way to use them polymorphically.
On the contrary, there is the Edison package
...which sounds quite
On 12 November 2010 20:33, Malcolm Wallace malcolm.wall...@me.com wrote:
Either that, or people find it awkward to deal with the substantial
extra hierarchies of type classes.
After the initial version in in PDFS it also developed operation
bloat. e.g. the added Sequence class has many methods
On 12 November 2010 20:44, Andrew Coppin andrewcop...@btinternet.com wrote:
Just today I was thinking about how useful it would be if you could send a
block of code from one PC to another to execute it remotely. The fact that
you can't do this is basically why there's no distributed Haskell
On Fri, Nov 12, 2010 at 12:34 PM, Luke Palmer lrpal...@gmail.com wrote:
Yeah I think a package of randomness tests could be really useful. Cool
:-)
There are already well-established suites of very thorough PRNG tests, such
as Diehard and Big Crush. Please don't invent another.
On Nov 12, 2010, at 12:44 PM, Andrew Coppin wrote:
Just today I was thinking about how useful it would be if you could
send a block of code from one PC to another to execute it remotely.
The fact that you can't do this is basically why there's no
distributed Haskell yet, despite what an
On 12/11/10 20:56, Bryan O'Sullivan wrote:
On Fri, Nov 12, 2010 at 12:34 PM, Luke Palmer lrpal...@gmail.com
mailto:lrpal...@gmail.com wrote:
Yeah I think a package of randomness tests could be really useful.
Cool :-)
There are already well-established suites of very thorough PRNG
Records do leave quite a bit to be desired. But does anybody actually have a
concrete alternative proposal yet?
A few months ago I proposed a couple of extensions [1] on -cafe.
The jist of it is in the following:
someUpdate :: MyRecord - MyRecord
someUpdate myRecord = myRecord
{ field1 =
From
http://www.haskell.org/ghc/docs/6.12.2/html/users_guide/bugs.html#bugs-ghc:
GHC's inliner can be persuaded into non-termination using the standard
way to encode recursion via a data type:
data U = MkU (U - Bool)
russel :: U - Bool
russel u@(MkU p) = not $ p u
x :: Bool
x =
On 12 November 2010 21:48, Jonathan Geddes geddes.jonat...@gmail.com wrote:
I cringe to imagine what the equivalent is in current Haskell syntax.
Anyone want to try it? Not me!
Perhaps not pretty - but it is regular and avoids Template Haskell an
manages for the few times I have
On Fri, Nov 12, 2010 at 1:28 PM, Richard Senington sc06...@leeds.ac.ukwrote:
Thankyou for the advice, but since I am just learning about some of this
stuff, how about I have ago at implementing some of their tests?
Sure. See http://www.iro.umontreal.ca/~simardr/testu01/tu01.html for the
On 11/12/10 5:33 AM, Richard Senington wrote:
It does not give the results you would want. This may have something to
do with picking good parameters for the mkLehmerTree function.
For example, using a random setup, I just got these results
result expected range
16.814 expected = 16.0 (1,31)
On 11/12/10 4:53 PM, Ryan Ingram wrote:
From http://www.haskell.org/ghc/docs/6.12.2/html/users_guide/bugs.html#bugs-ghc:
GHC's inliner can be persuaded into non-termination using the standard
way to encode recursion via a data type:
More specifically, since your bad2 does not look recursive,
I've been working on a project that requires me to do screen scraping.
When I first started this, I worked off of other people's examples.
Not one used regex. By luck I found someone at work to help me along
this project. His clues and hints don't use regex either. I was at a
point where I had to
On 11/12/10 6:56 PM, Michael Litchard wrote:
I've been working on a project that requires me to do screen scraping.
When I first started this, I worked off of other people's examples.
Not one used regex. By luck I found someone at work to help me along
this project. His clues and hints don't use
It took me a bit to decide whether this was an adequate counter to my
objection, but ultimately, I don't think it is. I'll try to explain as well as
possible.
On Friday 12 November 2010 1:40:10 pm rocon...@theorem.ca wrote:
As you are well aware in Coq, and in Agda we don't have an
hi ,folks ,
I'm a newbie of haskell and learn haskell using the textbook Real
World Haskell.
in the page 201,
ghci good food =~ .ood :: [String]
my output is here https://gist.github.com/675024
it doesn't match what the textbook gives . And I found the ebook of
Real World Haskell doesn't
45 matches
Mail list logo
