Hello,
I am confused between Haskell as delineated in the Haskell Report VS
ghc pragmas which extend Haskell beyond the Haskell Report. I am sure I am
not the first to ask. Caveat: on my part, I am not against
innovation/extensions, but I don't like to see language bloat. This is not
a
On May 17, 2009, at 02:32 , Vasili I. Galchin wrote:
I am confused between Haskell as delineated in the Haskell
Report VS ghc pragmas which extend Haskell beyond the Haskell
Report. I am sure I am not the first to ask. Caveat: on my part, I
am not against innovation/extensions, but I
I get
d...@linux-6ofq:~/asn1 runghc Setup.hs configure
Configuring PER-0.0.20...
Setup.hs: At least the following dependencies are missing:
time -any -any
but I have time
d...@linux-6ofq:~/asn1 ghc-pkg list | grep time
old-locale-1.0.0.1, old-time-1.0.0.2, packedstring-0.1.0.1,
Data/Generics/SYB/WithClass/Derive.hs:187:26:
Couldn't match expected type `Pred' against inferred type `Type'
Expected type: PredQ
Inferred type: TypeQ
In the first argument of `map', namely `dataCxt'
In the first argument of `(++)', namely `map dataCxt dataCxtTypes'
On Sun, 2009-05-17 at 09:17 +0100, Dominic Steinitz wrote:
I get
d...@linux-6ofq:~/asn1 runghc Setup.hs configure
Configuring PER-0.0.20...
Setup.hs: At least the following dependencies are missing:
time -any -any
but I have time
d...@linux-6ofq:~/asn1 ghc-pkg list | grep time
Am Sonntag, 17. Mai 2009 01:07:55 schrieb Gregory D. Weber:
I'd like to get the scenegraph package
(http://hackage.haskell.org/cgi-bin/hackage-scripts/package/scenegraph)
to work, but am encountering linkage errors.
[...]
Also, I notice that in the cabal file for scenegraph, the
list of
Am Freitag, 15. Mai 2009 06:37:22 schrieb Don Stewart:
timd:
On a related matter, I am using Data.Binary to serialise data from
haskell for use from other languages. [...]
[...]
Yep, it's possible, just not portably so. Google for Data.Binary IEEE
discussions.
I think this topic pops up
False alarm. It compiles OK with ghc 6.10.3.
The failure was with ghc 6.11.20090404.
--
Colin Adams
Preston Lancashire
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sven.Panne:
Am Freitag, 15. Mai 2009 06:37:22 schrieb Don Stewart:
timd:
On a related matter, I am using Data.Binary to serialise data from
haskell for use from other languages. [...]
[...]
Yep, it's possible, just not portably so. Google for Data.Binary IEEE
discussions.
I think
vigalchin:
Hello,
I am confused between Haskell as delineated in the Haskell Report VS ghc
pragmas which extend Haskell beyond the Haskell Report. I am sure I am not
the first to ask. Caveat: on my part, I am not against innovation/extensions,
but I don't like to see language bloat.
I was just looking at my UML (Unified Modeling Language) User Guide and
discovered this:
The number of object-oriented methods increased from fewer than 10 to more
than 50 during the period between 1989 and 1994. pg. xviii, Booch, Rumbaugh,
Jacobson, 1999
Is there a modeling methodology
From the documentation:
LI could be a strict monad and a strict applicative functor.
However it is not a lazy monad nor a lazy applicative
functor as required Haskell. Hopefully it is a lazy
(pointed) functor at least.
I'd like to understand this better -- how is LI
Vasili I. Galchin vigalc...@gmail.com writes:
Hello,
I am confused between Haskell as delineated in the Haskell Report VS
ghc pragmas which extend Haskell beyond the Haskell Report.
Pragmas are part of the report, and while I agree that using
them for extensions is stretching the
Hello Haskell Cafe
I have released the first version of TxtSushi which is a collection of
command line utils (written in haskell of course) for processing
tab-delimited and CSV files. It includes a util for doing SQL SELECTs
on flat files. This is my first haskell project and feedback of all
This is crazy cool!
I will now use your project as an example of what one can do as his
first project in Haskell; I think doing SQL on CSV files definitely
counts as a huge success story!
2009/5/17 Keith Sheppard keiths...@gmail.com:
Hello Haskell Cafe
I have released the first version of
Keith Sheppard wrote:
I have released the first version of TxtSushi which is a collection of
command line utils (written in haskell of course) for processing
tab-delimited and CSV files. It includes a util for doing SQL SELECTs
on flat files. This is my first haskell project and feedback of
By the way: As I see from the sources, your code uses external sort?
But using String's much defeats the purpose of it, anyway, because
their performance is so bad that if you feed your program a file that
is larger than can be sorted in memory, sorting it externally using
String's will anyway
Thanks for the encouraging reply! By the way, I was part way through
writing my own code for external sorting which I don't actually use
yet except from some test executable (joincol.hs). I'm very glad to
see that there is already a library that does this though, so in my
next version I will dump
Thanks! Good advice, I will do that.
On Sun, May 17, 2009 at 11:49 AM, Jochem Berndsen joc...@functor.nl wrote:
Keith Sheppard wrote:
I have released the first version of TxtSushi which is a collection of
command line utils (written in haskell of course) for processing
tab-delimited and CSV
Hello,
Is there any research on applying free theorems / parametricity to
type systems more complex than System F; namely, Fomega, or calculus
of constructions and alike?
This seems very promising to me for the following reason: Take the
free theorem for 'sort::(a-a-Bool)-[a]-[a]'. The theorem
michael rice wrote:
I was just looking at my UML (Unified Modeling Language) User Guide
and discovered this:
The number of object-oriented methods increased from fewer than 10 to
more than 50 during the period between 1989 and 1994. pg. xviii,
Booch, Rumbaugh, Jacobson, 1999
Is there a
On Sun, 17 May 2009 23:10:12 +0400
Eugene Kirpichov ekirpic...@gmail.com wrote:
Is there any research on applying free theorems / parametricity to
type systems more complex than System F; namely, Fomega, or calculus
of constructions and alike?
Yes. I did some research into it as part of my
I'm glad that someone is doing research in that direction!
Are your results so far applicable to create a free theorem for that
example with sortBy?
2009/5/17 Robin Green gree...@greenrd.org:
On Sun, 17 May 2009 23:10:12 +0400
Eugene Kirpichov ekirpic...@gmail.com wrote:
Is there any research
Hi Paul,
I've been away from software design for more than a decade and have fallen
behind on what's currently being used. I wasn't even aware of RUP.
Thanks for the info.
Michael
--- On Sun, 5/17/09, Paul Johnson p...@cogito.org.uk wrote:
From: Paul Johnson p...@cogito.org.uk
Subject: Re:
Already posted to the Haskell list but dons suggested I post to the cafe, as
well...
All:
mathlink is a library for writing Mathematica packages in Haskell.
One simply writes some functions of type:
(MLGet a, MLPut b) = a - IO b
and provides a package specification in a simple DSL that mimics
This word has piqued my interest, I've hear it tossed around the
community quite a bit, but never fully understood what it meant. What
exactly is a 'free theorem'?
Eugene Kirpichov wrote:
Hello,
Is there any research on applying free theorems / parametricity to
type systems more complex than
Free theorem's are theorems about functions that rely only on parametricity.
For example, consider any function f with the type
forall a. a - a
From its type, I can tell you directly that this theorem holds:
forall g :: A - B, x :: A,
f (g x) = g (f x)
(Note that the f on the left
I've got one of those algorithms which threatens to march off the right edge
(in the words of Goerzen et al). I need something like a State or Maybe monad,
but this is inside the IO monad. So I presume I need StateT or MaybeT. However,
I'm still (slowly) learning about monads from first
Hi,
I'm a Haskeller that uses Mathematica on a regular basis; it's one of
my favourite tools.
So - thanks for your work, I'll use it whenever applicable.
However, during compilation I get an error that ml.h is not found,
even after I added Mathematica's include dirs to Include-Dirs.
Since that
29 matches
Mail list logo
