in F# they renamed Monad to Workflow,
I don't think this is helpful,
I didn't claim ... at least it's a funny attempt
to introduce warm fuzzy thing terminology.
it only really works for state-like monads.
Workflow doesn't make sense at all for [a], for example.
Well, it could be seen as
No solid plans yet. Mostly I wanted to get some kind of start on a
collection of space partitioning data structures.
Some ideas
- haddock documentation
- automated tests
- bounding volume hierarchies.
- Extend into 3D
My current use of the quadtree is for collision detection. Though also
Hi
to mind), if Hugs is likely to continue to have compatibility problems
with GHC, then is there any way an interface similar to that already
available for WinHugs could be created for GHCi?
If that gets underway, one additional improvement could be to improve
the REPL at handling declared
On Wed, Dec 24, 2008 at 12:05 PM, Johannes Waldmann
waldm...@imn.htwk-leipzig.de wrote:
About the prestress, that's one of the motivations behind renaming
them (warm fuzzy thing is the current tongue-in-cheek alternative).
in F# they renamed Monad to Workflow,
see e.g. Chapter 9 (p.
Hi
The INSTALL file in the hmatrix repository has some very clear instructions for
installation on Windows.
http://perception.inf.um.es/~aruiz/darcs/hmatrix/INSTALL
However note this section at the bottom:
Unfortunately the lapack dll supplied by the R system does not include
zgels_, zgelss_,
I was planning to recompile everything (ATLAS, LAPACK and GHC included) this
weekend, so I can have a similar environment on Windows and Linux... Having
to borrow libraries
Since I am married, this means it will actually happen on some weekend till
2010.
What I really would like to try is a
On Tue, 2009-01-27 at 21:41 -0600, John Goerzen wrote:
I have tried to maintain Hugs compatibility in all my libraries, but I
must admit I am dropping it for many, due to various problems. It is
mainly that libraries I use from others haven't even been tried with
Hugs or have weird issues:
Achim Schneider wrote:
So what's left of those TK's if we don't use their abstractions and
replace them with Haskell? Drawing and layouting, that's what's
left[3]. Both, IMNSHO, do not justify carrying around bloaty external
dependencies, they're too trivial. They certainly don't justify
Hi,
Sugestion: 'when' in Control.Monad is typed
as :: Bool - IO () - IO ().
Why not type it as:
:: forall a. = Bool - IO a - IO ()
? It is easy for 'when' to ignore the result
of the first computation, and this would not
break existing code, and also save a lot of
return ()s.
Best,
Mauríco
Alex == Alex Ott alex...@gmail.com writes:
Alex Hello For Emacs users it could be interesting - I wrote
Alex small module for more comfortable work with HLint from
Alex Emacs. It has same functionality as compilation-mode -
Alex navigation between errors, etc.
Alex To use
Well, I guess I am not the only one!
This blog show exactly what I am looking for!
http://quantile95.com/2008/10/31/ann-blas-bindings-for-haskell-version-06/
On Wed, Jan 28, 2009 at 08:21, Rafael Gustavo da Cunha Pereira Pinto
rafaelgcpp.li...@gmail.com wrote:
I was planning to recompile
Maurício wrote:
? It is easy for 'when' to ignore the result
of the first computation, and this would not
break existing code, and also save a lot of
return ()s.
As Neil Mitchell pointed out[1], ignoring results implicitly may
indicate an error. Perhaps it's cleaner to define
ignore m =
G == Gour writes:
Massimiliano == Massimiliano Gubinelli m.gubine...@gmail.com writes:
Massimiliano As far as Haskell is concerned, a good interface, would
Massimiliano allow to bypass programs like lhs2tex or in general allow
Massimiliano for beautyful editing Of course not everyone
Hi,
allan wrote:
Hi
The INSTALL file in the hmatrix repository has some very clear
instructions for installation on Windows.
http://perception.inf.um.es/~aruiz/darcs/hmatrix/INSTALL
However note this section at the bottom:
Unfortunately the lapack dll supplied by the R system does not
? It is easy for 'when' to ignore the result
of the first computation, and this would not
break existing code, and also save a lot of
return ()s.
As Neil Mitchell pointed out[1], ignoring results implicitly may
indicate an error. Perhaps it's cleaner to define
ignore m = m return ()
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Maurício wrote:
| ignore m = m return ()
|
|
| But isn't exactly that the behavior of ()?
~ignore :: Monad m = m a - m ()
~() :: Monad m = m a - m b - m b
It may also be worth noting that ignore can be generalized to Functor:
~
On Wed, Jan 28, 2009 at 6:30 AM, Colin Paul Adams
co...@colina.demon.co.uk wrote:
Alex == Alex Ott alex...@gmail.com writes:
Alex Hello For Emacs users it could be interesting - I wrote
Alex small module for more comfortable work with HLint from
Alex Emacs. It has same functionality
http://haskell.org/haskellwiki/Emacs#Unicodifying_symbols_.28Pretty_Lambda_for_Haskell-mode.29
I'm pretty sure this text wasn't there last time I looked, yet last time
I looked was already long after Haskell-mode integrated such a feature.
In any case I've added a note to mention that all you
Hello people,
I've recently tried this:
$ uname -smpr
Linux 2.6.28-ARCH x86_64 Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz
$ ghci
GHCi, version 6.10.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ... done.
Loading package integer ... linking ... done.
Loading package
On Wed, Jan 28, 2009 at 7:56 AM, Juraj Hercek juhe_hask...@hck.sk wrote:
Hello people,
I've recently tried this:
$ uname -smpr
Linux 2.6.28-ARCH x86_64 Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz
$ ghci
GHCi, version 6.10.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ...
I was writing code similar to the following and compiling with -Wall
-Werror. Clearly I *am* using Data.ByteString for the function signatures.
{-# OPTIONS_GHC -fwarn-unused-imports -Werror #-}
import qualified Data.ByteString as B
import qualified Data.ByteString.UTF8 as BU
toString ::
On Jan 27, 2009, at 1:05 PM, Michaeljohn Clement wrote:
+1
This is the conclusion I have come to in building collaborative
Web applications.
I agree that there seems to be a gap here in the Haskell Web
frameworks people are building.
Yes. It's a dead end and it seems a shame to waste effort
Dan Mead wrote:
has there been any movement on this topic? i'm also interested in
haskell on arm
do you guys thing telling ghc to emit C and then compiling that for arm
is a better route than
getting direct compilation to work?
If you look on the GHC-on-ARM page[1], you'll find my
This is a bug in GHC. See:
http://hackage.haskell.org/trac/ghc/ticket/2267
I have the same problem in several of my source files. :-(
Michael Snoyman wrote:
I was writing code similar to the following and compiling with -Wall
-Werror. Clearly I *am* using Data.ByteString for the function
wren ng thornton wrote:
John Goerzen wrote:
Hi folks,
I have uploaded a new package to Haskell: convertible. At its heart,
it's a very simple typeclass that's designed to enable a reasonable
default conversion between two different types without having to
remember a bunch of functions.
I
Hi Manuel,
thanks for your quick response.
Hi Fabian,
I've just begun to play with Data Parallel Haskell but instantly ran
into a
problem. My very stupid but very simple example ought to sum the
values of
all Nodes in a Tree. The non-vectorised code behaves like I
expected, the
Hello,
$ cabal install category-extras
Resolving dependencies...
cabal: dependencies conflict: ghc-6.10.1 requires process ==1.0.1.1 however
process-1.0.1.1 was excluded because ghc-6.10.1 requires process ==1.0.1.0
What does this message mean? It makes little sense to me -- ghc-6.10.1
/attachments/20090128/4b1ba353/attachment.htm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Martijn van Steenbergen mart...@van.steenbergen.nl wrote:
Hello,
$ cabal install category-extras
Resolving dependencies...
cabal: dependencies conflict: ghc-6.10.1 requires process ==1.0.1.1
however process-1.0.1.1 was excluded because ghc-6.10.1 requires
process ==1.0.1.0
What does
On Wednesday 28 January 2009 08:15:44 am Braden Shepherdson wrote:
Dan Mead wrote:
has there been any movement on this topic? i'm also interested in
haskell on arm
do you guys thing telling ghc to emit C and then compiling that for arm
is a better route than
getting direct
Excerpts from Martijn van Steenbergen's message of Wed Jan 28 17:33:18 +0100
2009:
This is a bug in GHC. See:
http://hackage.haskell.org/trac/ghc/ticket/2267
I have the same problem in several of my source files. :-(
Sometimes swaping the import lists does hide this wrong warning.
Simple, Incremental SAT Solving as a Library
This Haskell library provides an implementation of the Davis-Putnam-
Logemann-Loveland algorithm (cf. http://en.wikipedia.org/wiki/DPLL_algorithm
) for the boolean satisfiability problem. It not only
On Tue, Jan 27, 2009 at 1:18 PM, Duncan Coutts
duncan.cou...@worc.ox.ac.ukwrote:
Not since then, no. However a lot of things work fine, especially if you
use a newer Cabal version.
I've been unable to figure out how to build Cabal with Hugs 2006.09.04:
$ *runhugs -98 Setup configure --hugs
John Lato jwl...@gmail.com wrote:
Achim Schneider wrote:
So what's left of those TK's if we don't use their abstractions and
replace them with Haskell? Drawing and layouting, that's what's
left[3]. Both, IMNSHO, do not justify carrying around bloaty
external dependencies, they're too
Bryan O'Sullivan wrote:
On Tue, Jan 27, 2009 at 1:18 PM, Duncan Coutts
duncan.cou...@worc.ox.ac.ukwrote:
Not since then, no. However a lot of things work fine, especially if you
use a newer Cabal version.
I've been unable to figure out how to build Cabal with Hugs 2006.09.04:
$ *runhugs
wren ng thornton wrote:
Bryan O'Sullivan wrote:
On Tue, Jan 27, 2009 at 1:18 PM, Duncan Coutts
duncan.cou...@worc.ox.ac.ukwrote:
Not since then, no. However a lot of things work fine, especially if you
use a newer Cabal version.
I've been unable to figure out how to build Cabal with Hugs
In testing some of my packages against Hugs, I've uncovered bugs[1].
Unfortunately the bug tracker at:
http://hackage.haskell.org/trac/hugs/newticket?type=defect
doesn't seem to allow normal users to submit tickets. Does anyone know
how to submit bug reports to Hugs these days?
[1]
John Goerzen wrote:
wren ng thornton wrote:
I once again point out that realToFrac is *wrong* for converting from
Float or Double.
realToFrac (1/0::Float) ::Double
3.402823669209385e38
Yes, I understand what you are saying and agree with you. But there
is nothing better in the
wren ng thornton wrote:
John Goerzen wrote:
wren ng thornton wrote:
I once again point out that realToFrac is *wrong* for converting from
Float or Double.
realToFrac (1/0::Float) ::Double
3.402823669209385e38
Yes, I understand what you are saying and agree with you. But there
wren ng thornton wrote:
[1] The Ord instance for Float and Double is also wrong, since NaN means
there's no total ordering (and the existence of NaN is necessitated by
the existence of Infinity). In addition to the fact that partial
orderings are more common than total orderings, this
Conrad Meyer wrote:
On Wednesday 28 January 2009 08:15:44 am Braden Shepherdson wrote:
Dan Mead wrote:
has there been any movement on this topic? i'm also interested in
haskell on arm
do you guys thing telling ghc to emit C and then compiling that for arm
is a better route than
getting
On Wed, Jan 28, 2009 at 5:28 PM, wren ng thornton w...@freegeek.org wrote:
John Goerzen wrote:
wren ng thornton wrote:
I wonder if you would consider submitting a patch to base? It seems
that this is a sore problem there, and ideally should be dealt with
properly in base.
As Bertram
On Wed, 2009-01-28 at 12:35 -0800, Bryan O'Sullivan wrote:
On Tue, Jan 27, 2009 at 1:18 PM, Duncan Coutts
duncan.cou...@worc.ox.ac.uk wrote:
Not since then, no. However a lot of things work fine,
especially if you
use a newer Cabal version.
I've been unable to
On Wed, 2009-01-28 at 16:26 -0500, wren ng thornton wrote:
wren ng thornton wrote:
Bryan O'Sullivan wrote:
On Tue, Jan 27, 2009 at 1:18 PM, Duncan Coutts
duncan.cou...@worc.ox.ac.ukwrote:
Not since then, no. However a lot of things work fine, especially if you
use a newer Cabal
On Wed, 2009-01-28 at 18:41 -0500, Michael D. Adams wrote:
On Wed, Jan 28, 2009 at 5:28 PM, wren ng thornton w...@freegeek.org wrote:
John Goerzen wrote:
wren ng thornton wrote:
I wonder if you would consider submitting a patch to base? It seems
that this is a sore problem there, and
ghc llvm port would enable arm support as well. i know there were
some issues with llvm when this was discusses a couple of years ago.
has anyone checked if that's the case?
On Wed, Jan 28, 2009 at 3:14 PM, Braden Shepherdson
braden.shepherd...@gmail.com wrote:
Conrad Meyer wrote:
On
I'm trying to do a calculation for Gauss' circle problem, which counts the
integer lattice points with distance to the origin = r. It's sequence
A000328 on the ATT integer sequence database. I can't figure out a way to
do it quickly in Haskell for r around 10^9.
Here's my attempt, which takes
On Wed, 2009-01-28 at 18:22 +0100, Martijn van Steenbergen wrote:
Hello,
$ cabal install category-extras
Resolving dependencies...
cabal: dependencies conflict: ghc-6.10.1 requires process ==1.0.1.1 however
process-1.0.1.1 was excluded because ghc-6.10.1 requires process ==1.0.1.0
What
On Wed, 2009-01-28 at 16:56 +0100, Juraj Hercek wrote:
Hello people,
I've recently tried this:
$ uname -smpr
Linux 2.6.28-ARCH x86_64 Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz
$ ghci
GHCi, version 6.10.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ...
On Wed, 2009-01-28 at 16:42 -0800, drblanco wrote:
I do already have the number I wanted, but was wondering how this could be
made faster, or even why it's so slow. This is all on GHC 6.8.3 under OS X
Intel, using ghc -O2.
I'm not exactly sure what's different, but for me it works pretty
Did you print it? I'm using same code with ghc --make -O2 and it
takes forever to finish.
On Wed, Jan 28, 2009 at 8:06 PM, Duncan Coutts
duncan.cou...@worc.ox.ac.uk wrote:
On Wed, 2009-01-28 at 16:42 -0800, drblanco wrote:
I do already have the number I wanted, but was wondering how this
On Wed, 2009-01-28 at 20:11 -0500, sam lee wrote:
Did you print it? I'm using same code with ghc --make -O2 and it
takes forever to finish.
Yes, you can see in the output that it prints the same answer in each
case. I was using r = 10^9 as you suggested.
C version:
$ time ./circ
Duncan, I think you must have some magics -- on my machine the
original code also takes forever.
Running with +RTS -S indicates it's allocating several gig of memory
or more.
Applying some bang patterns gives me ~8s for 10^8 and somewhat more
than a minute for 10^9:
{-# LANGUAGE
Ross Mellgren schrieb:
Duncan, I think you must have some magics -- on my machine the original
code also takes forever.
Running with +RTS -S indicates it's allocating several gig of memory or
more.
Applying some bang patterns gives me ~8s for 10^8 and somewhat more than
a minute for 10^9:
Yeah, you know after sending the email (never a better time) I noticed
that the C version wasn't spitting out the right answer. I'm not
really sure why, I just replaced bigint with int64_t from stdint.h.
-Ross
On Jan 28, 2009, at 8:32 PM, Benedikt Huber wrote:
Ross Mellgren schrieb:
On Wed, 2009-01-28 at 20:23 -0500, Ross Mellgren wrote:
Duncan, I think you must have some magics -- on my machine the
original code also takes forever.
Running with +RTS -S indicates it's allocating several gig of memory
or more.
It runs in a tiny heap for me:
./circ2 +RTS -A10k -M20k
Thanks for the help. It's clear in retrospect that it was being too
lazy, but not why changing to Int64 did it. The bang patterns made
the difference between runnable and not.
GHC 6.10 didn't make much of a difference, but there's no 64-bit build
for the Mac. If this seems to come up again
Ross Mellgren wrote:
Duncan, I think you must have some magics -- on my machine the original
code also takes forever.
Running with +RTS -S indicates it's allocating several gig of memory or
more.
Applying some bang patterns gives me ~8s for 10^8 and somewhat more than
a minute for 10^9
It
Apparently 64-bit GHC is sufficiently advanced to be indistinguishable
from magic. Now, if only there was a 64-bit binary for Mac OS X :-/
-Ross
On Jan 28, 2009, at 9:06 PM, Jake McArthur wrote:
Ross Mellgren wrote:
Duncan, I think you must have some magics -- on my machine the
original
Hi John,
I've just been going through the HDBC-ODBC code wondering if I could
find the spot that needs changing so that Doubles work properly with
MS-Access.
Could you please tell me, if I understand this correctly?
The bindCol function does not actually look at the particular value
type,
On Wed, 2009-01-28 at 20:42 -0500, Ross Mellgren wrote:
Very possibly -- I'm on a mac so no prebuilt 64-bit binary. I'm not
good enough at reading core to tell, but I can tell from the core that
it's calling out to external C functions to do the 64-bit math.
Right, that'll make it really
On Wed, 28 Jan 2009 16:45:29 -0500, wren ng thornton
w...@freegeek.org wrote:
[...]
Does anyone know
how to submit bug reports to Hugs these days?
Have you tried subscribing to the Hugs Bugs mailing list at
http://www.haskell.org/mailman/listinfo/hugs-bugs ?
-- Benjamin L. Russell
--
Hi,
I guess the question is: what type of data does Access need in that
situation?
So, as an example: say you have an 8-bit Integer column in Access, and
someone passes an SqlInt64 to the system. What do you do? Can you
pass an Int64 to Access and have it convert?
In general, the ODBC spec --
John Goerzen wrote:
wren ng thornton wrote:
John Goerzen wrote:
wren ng thornton wrote:
I once again point out that realToFrac is *wrong* for converting from
Float or Double.
Yes, I understand what you are saying and agree with you. But there
is nothing better in the standard
On Wed, Jan 28, 2009 at 13:32, Sebastian Fischer
s...@informatik.uni-kiel.de wrote:
Simple, Incremental SAT Solving as a Library
This Haskell library provides an implementation of the
Davis-Putnam-Logemann-Loveland algorithm (cf.
Duncan Coutts wrote:
Michael D. Adams wrote:
Is there a good reason why Rational is defined in a way that it can
not represent Nan, Inf and -Inf? (Any other exceptional values I
forgot?) Would fixing the definition so that it can represent those
values be sufficient to fix this entire
Hello!
I'm puzzled, if in Haskell it's possible to create a (pure) data structure,
consisting of 2 substructures referencing each other:
-
data AA = AA {
someData1 :: SomeData1
bb :: BB
}
data BB = BB {
someData2 :: SomeData2
aa :: AA
}
Yes.
f somedata1 somedata2 = aa
where aa = AA somedata1 bb
bb = BB somedata2 aa
2009/1/29 Belka lambda-be...@yandex.ru:
Hello!
I'm puzzled, if in Haskell it's possible to create a (pure) data structure,
consisting of 2 substructures referencing each other:
By the way, more advanced stuff of this kind is called Tying the
knot; you can do doubly linked lists with it and much more.
http://www.haskell.org/haskellwiki/Tying_the_Knot
2009/1/29 Belka lambda-be...@yandex.ru:
Hello!
I'm puzzled, if in Haskell it's possible to create a (pure) data
69 matches
Mail list logo
