Hello,
Thank everybody for the answers.
I must admit that I did not really emphasize the goal behind my initial
question. Which is better expressed this way:
'walk' is written is CPS and is tail recursive. Unless I am wrong , if the
continuation monad is used, the recursive calls to 'walk' are
On Wed, Nov 11, 2009 at 11:22 PM, David Virebayre
dav.vire+hask...@gmail.com wrote:
On Thu, Nov 12, 2009 at 7:18 AM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Evan,
Thursday, November 12, 2009, 4:02:17 AM, you wrote:
Recently the go language was announced at golang.org.
Hello David,
Thursday, November 12, 2009, 10:22:41 AM, you wrote:
are you seen hugs, for example? i think that ghc is slow because it's
written in haskell and compiled by itself
If I understood, Evan is interested in ideas to speed up compilation.
As far as I know, hugs is an interpreter,
Hiya Haskellers,
So there I was, punching away at the keys, working on the Haskell
Weekly News tools when the solution to one of my problems fell on me
like a ton of lambdas. The solution and problem it solved are
immaterial, but suffice to say it involved the combination of
associated
| [1 of 3] Compiling Network.HackMail.Email.ParseEmail ( Network/
| HackMail/Email/ParseEmail.hs, interpreted )
| [2 of 3] Compiling Network.HackMail.Email.Email ( Network/HackMail/
| Email/Email.hs, interpreted )
| [3 of 3] Compiling Network.HackMail.Filter.Filter ( Network/HackMail/
|
On Thu, Nov 12, 2009 at 7:32 AM, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Hi,
Today, when I compiled gtk2hs, I got this:
cairo/Graphics/Rendering/Cairo.hs.pp:264:0:
Failed to load interface for `Data.Array.Base':
it is a member of the hidden package `array-0.2.0.0'
No, it is not. I used configure/make way.
Well I just noticed that there is a hide-all-package options to ghc.
I do not know why. Maybe the author went crazy.
On Thu, Nov 12, 2009 at 5:09 PM, Magnus Therning mag...@therning.org wrote:
On Thu, Nov 12, 2009 at 7:32 AM, Magicloud Magiclouds
On Thu, Nov 12, 2009 at 8:57 AM, David Virebayre
dav.vire+hask...@gmail.com wrote:
On Wed, Nov 11, 2009 at 5:44 PM, Svein Ove Aas svein@aas.no wrote:
My recommendation would be to take glibc off the list of statically
linked libraries.
How do you do that ?
By specifying the entire list
Excerpts from wren ng thornton's message of Thu Nov 12 08:17:41 +0100 2009:
Nicolas Pouillard wrote:
Excerpts from jean-christophe mincke's message of Tue Nov 10 21:18:34 +0100
2009:
do acc - get
put (acc+1)
...
Since this pattern occurs often 'modify' is a combination of
On Thu, Nov 12, 2009 at 9:11 AM, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
No, it is not. I used configure/make way.
Well I just noticed that there is a hide-all-package options to ghc.
I do not know why. Maybe the author went crazy.
Chances are the auther DIDN'T go crazy :-)
Excerpts from Евгений Пермяков's message of Thu Nov 12 00:33:07 -0700 2009:
When I try cabal-install lambdabot (gentoo linux/amd64, ghc installed with
portage), it runs fine until compiler tries to link readline package (some
template haskell?). The problem caused by dirty trick, used in
to answer this question myself how the use of another gcc is specified
with effect, I used the following options with the 'cabal install' call:
--ghc-options=-pgmc e:/programme/ghc/mingw-gcc4/bin/gcc.exe -pgml
e:/programme/ghc/mingw-gcc4/bin/gcc.exe
See
David Menendez wrote:
I think replacing put s with put $! s should guarantee that the
state is evaluated.
If you're using get and put in many place in the code, you could try
something along these lines:
newtype SStateT s m a = S { unS :: StateT s m a } deriving (Monad, etc.)
instance
2009/11/12 Heinrich Apfelmus apfel...@quantentunnel.de
Interestingly, this is different from Control.Monad.State.Strict . The
latter never forces the state itself, just the pair constructor of the
(result,state) pair.
Yes. This bit me the first time I came across it. I think we need a
On Wed, Nov 04, 2009 at 07:01:50PM +0100, Sjoerd Visscher wrote:
To: Haskell Cafe haskell-cafe@haskell.org
From: Sjoerd Visscher sjo...@w3future.com
Date: Wed, 4 Nov 2009 19:01:50 +0100
Subject: Re: [Haskell-cafe] Fair diagonals (code golf)
The code by Twan can be reduced to this:
diagN
2009/11/12 Heinrich Apfelmus apfel...@quantentunnel.de
Interestingly, this is different from Control.Monad.State.Strict . The
latter never forces the state itself, just the pair constructor of the
(result,state) pair.
Yes. This bit me the first time I came across it. I think we need a
jean-christophe mincke wrote:
I do not master all the subtilities of lazy evaluation yet and perhaps tail
recursivity does not have the same importance (or does not offer the same
guarantees) in a lazy language as it does in a strict language.
Yep, that's the case. With lazy evaluation, tail
Hello.
I'm writing an wxHaskell application. Everything is ok, but now I need
a separate folder for icons, bitmaps, and so on, from where they are
loaded at runtime. How can I compile resources, and link them into my
executable to provide for users single .exe file with resource section
inside
Dan Piponi wrote:
To use these types with ghc you need to use the compilation flag
-XExistentialQuantification.
Or, more portably, add {-# LANGUAGE ExistentialQuantification #-} at the
top of the source file. It should now compile in any computer that
supports this feature without any
Joe Fredette wrote:
Forall means the same thing as it means in math
...which not everybody already knows about. ;-)
Even I am still not 100% sure how placing forall in different positions
does different things. But usually it's not something I need to worry
about. :-)
2009/11/12 Andrew Coppin andrewcop...@btinternet.com:
Joe Fredette wrote:
Forall means the same thing as it means in math
...which not everybody already knows about. ;-)
Even I am still not 100% sure how placing forall in different positions does
different things. But usually it's not
On Thu, Nov 12, 2009 at 8:01 AM, Matthew Pocock
matthew.poc...@ncl.ac.uk wrote:
Yes. This bit me the first time I came across it. I think we need a
Control.Monad.State.StrictOnState with strict behaviour on the state value.
I notice this same underlying issue is coming up in more than one
Eugene Kirpichov wrote:
2009/11/12 Andrew Coppin andrewcop...@btinternet.com:
Even I am still not 100% sure how placing forall in different positions does
different things. But usually it's not something I need to worry about. :-)
To me it does not look like it does different things:
2009/11/12 Neil Brown nc...@kent.ac.uk:
Eugene Kirpichov wrote:
2009/11/12 Andrew Coppin andrewcop...@btinternet.com:
Even I am still not 100% sure how placing forall in different positions
does
different things. But usually it's not something I need to worry about.
:-)
To me it does
On Thu, Nov 12, 2009 at 11:12 AM, Konstantin Vladimirov
konstantin.vladimi...@gmail.com wrote:
Hello.
I'm writing an wxHaskell application. Everything is ok, but now I need
a separate folder for icons, bitmaps, and so on, from where they are
loaded at runtime. How can I compile resources, and
Hi,
I'd really love a faster GHC! I spend hours every day waiting for GHC,
so any improvements would be most welcome.
I remember when developing Yhc on a really low powered computer, it
had around 200 modules and loaded from scratch (with all the Prelude
etc) in about 3 seconds on Hugs. ghc
Hello Neil,
Thursday, November 12, 2009, 1:57:06 PM, you wrote:
I'd really love a faster GHC!
there are few obvious ideas:
1) use Binary package for .hi files
2) allow to save/load bytecode
3) allow to run program directly from .hi files w/o linking
4) save mix of all .hi files as program
Hello Konstantin,
Thursday, November 12, 2009, 1:12:35 PM, you wrote:
I'm writing an wxHaskell application. Everything is ok, but now I need
a separate folder for icons, bitmaps, and so on, from where they are
loaded at runtime. How can I compile resources, and link them into my
executable
Just joking. But still, since gtk2hs still using the configure/make
way, it is complex to add another option to the system. I tried to add
array to build-depends of Cairo.cabal, no luck.
On Thu, Nov 12, 2009 at 5:28 PM, Magnus Therning mag...@therning.org wrote:
On Thu, Nov 12, 2009 at 9:11 AM,
How about:
instance (Monad m) = MonadState s (SStateT s m) where
get = S get
put s = S (put $ using s $ strategy m)
where our state monad has a strategy field?
Matthew
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Bulat Ziganshin wrote:
it's impossible to interpret haskell - how can you do type inference?
hugs, like ghci, is bytecode interpreter. the difference is their
implementation languages - haskell vs C
We use Standard ML for the Isabelle/HOL theorem prover, and it's
interpreted, even has an
Regarding speeding up linking or compilation, IMO the real speedup you
would get from incremental compilation linking. It's okay if the
initial compilation linking take a long time, but the duration of
next cl iterations should only depend on the number of changes one
does, not on the total
Hello Rafal,
Thursday, November 12, 2009, 3:10:54 PM, you wrote:
it's impossible to interpret haskell - how can you do type inference?
hugs, like ghci, is bytecode interpreter. the difference is their
implementation languages - haskell vs C
We use Standard ML for the Isabelle/HOL theorem
Hello Peter,
Thursday, November 12, 2009, 3:26:21 PM, you wrote:
incremental is just a word. what exactly we mean? ghc, like any other
.obj-generating compiler, doesn't recompile unchanged source files (if
their dependencies aren't changed too). otoh, (my old ghc 6.6)
recompiles Main.hs if
On Thu, Nov 12, 2009 at 12:39 PM, Bulat Ziganshin bulat.zigans...@gmail.com
wrote:
Hello Peter,
Thursday, November 12, 2009, 3:26:21 PM, you wrote:
incremental is just a word. what exactly we mean?
Incremental linking means the general idea of reusing previous linking
results, only
Magicloud Magiclouds magicloud.magiclo...@gmail.com writes:
Just joking. But still, since gtk2hs still using the configure/make
way, it is complex to add another option to the system. I tried to add
array to build-depends of Cairo.cabal, no luck.
Yes, it's not handy that gtk2hs can't use
Also, a *service* should have a persistence periodical action which should
evaluate (most part of) the state thunks in their values to be serialized.
This work for the structure similarity of NFData and Show/Binary classes.
When there is a not directly serializable part of the state , things can
I've installed the flow2dot utility. It fails to produce a dot
file from the sample provided by it's author. The output of the program
is:
.cabal/bin/flow2dot sample.flow
flow2dot: Input:
order a b c d
a - b: let's play catch a ball!
b - c: i'll pass it along
c: what to do next?
c - a: lets
Now my program does not produce the error. A thread that was involved in the
process failed with the effect of blocking the main thread that processed
the socket input and produced the output. That ended up in this strange
error after waiting half a second (more or less). instead of being catched
Hi all,
I'm in the process of trying update the revisions of wx (part of
wxHaskell) on hackage.
I'm getting an error I find slightly surprising:
400 Error in upload
The dependency 'build-depends: base' does not specify an upper bound
on the version number. Each major release of the 'base'
Jeremy O'Donoghue wrote:
Hi all,
I'm in the process of trying update the revisions of wx (part of
wxHaskell) on hackage.
I'm getting an error I find slightly surprising:
...
Library
if flag(splitBase)
build-depends: base = 3, wxcore = 0.12.1.1, stm
Change this last line to base
On Thu, 2009-11-12 at 10:46 +0100, Daniel Kahlenberg wrote:
to answer this question myself how the use of another gcc is specified
with effect, I used the following options with the 'cabal install' call:
--ghc-options=-pgmc e:/programme/ghc/mingw-gcc4/bin/gcc.exe -pgml
Although it might be a pain in the arse to some degree, is there any
reason why 'base' is considered special?
As an example, I've come across a fair number of libraries/apps that
(presumably) compile against a previous version of OpenGL, but not the
current latest. Given it's impossible to test
Hi all,
Another, probably simple, question regarding cabalization.
Part of wxcore, the low level abstraction in wxHaskell, consists of
haskell modules which are generated automatically by parsing C headers
using another tool, wxdirect.
When trying to create an sdist package, we run into the
Okay, so -- I feel totally awesome -- I never found a GHC bug
before... and a Haskell Celebrity responded to my post! *swoons* :)
Serious question now, There's a fair amount of definitely irrelevant
code (like the definition of the `Email` type, etc), should I post
that in the report too
Hi Joe,
Serious question now, There's a fair amount of definitely irrelevant code
(like the definition of the `Email` type, etc), should I post that in the
report too (assuming it doesn't work in 6.12 or I can't get 6.12 working to
try it)?
http://hackage.haskell.org/trac/ghc/wiki/ReportABug
On Thu, 2009-11-12 at 17:54 +, Jeremy O'Donoghue wrote:
Hi all,
Another, probably simple, question regarding cabalization.
Part of wxcore, the low level abstraction in wxHaskell, consists of
haskell modules which are generated automatically by parsing C headers
using another tool,
Actually, I just solved the problem... I think...
In my original code, I had the newtype:
newtype FilterState t = Filter t a = Filter (ContextMatch t a)
deriving (Functor, Monad, MonadReader Email, MonadState Bool,
MonadIO)
I was trying to confirm that it actually was the `deriving
On Thu, 2009-11-12 at 17:37 +, Sam Martin wrote:
Although it might be a pain in the arse to some degree, is there any
reason why 'base' is considered special?
As an example, I've come across a fair number of libraries/apps that
(presumably) compile against a previous version of OpenGL,
I've had some luck with two techniques for this:
1. Create stub files, associated with a custom preprocessor which
knows how to parse them and generate a Haskell module. For example,
you might have Foo.wx-stub contain:
[headers]
wx/foo.h
wx/otherheader.h
and then parse it into
To: Casey Hawthorne cas...@istar.ca
Subject: Re: [Haskell-cafe] looking for a good algorithm
From: Casey Hawthorne cas...@istar.ca
Date: Thu, 12 Nov 2009 11:14:02 -0800
On third thought, convert the table to a 2D array of bits (or a 1D
array of bits mapped to a 2D coordinate system).
The bit is
On Thu, Nov 12, 2009 at 2:50 AM, Eugene Kirpichov ekirpic...@gmail.com wrote:
But that's not an issue of semantics of forall, just of which part of
the rather broad and universal semantics is captured by which language
extensions.
The forall for existential type quantification is wierd.
data
Eugene Kirpichov wrote:
2009/11/12 Andrew Coppin andrewcop...@btinternet.com:
Joe Fredette wrote:
Forall means the same thing as it means in math
...which not everybody already knows about. ;-)
Even I am still not 100% sure how placing forall in different positions does
2009/11/12 Ryan Ingram ryani.s...@gmail.com:
On Thu, Nov 12, 2009 at 2:50 AM, Eugene Kirpichov ekirpic...@gmail.com
wrote:
But that's not an issue of semantics of forall, just of which part of
the rather broad and universal semantics is captured by which language
extensions.
The forall for
Does anyone know here how GHC links in object files from other
languages? I am getting a strange issue where it seems to be getting
the calling convention on Fortran calls wrong.
Specifically, on one computer (Gentoo Linux) I have with gcc and
gfortran v4.4 and ghc compiled using gcc
Why can I run (runghc) some Haskell scripts but I cannot seem to
compile them?
e.g. http://www.haskell.org/all_about_monads/examples/example25.hs
I've changed the import listing to the following:
import IO
import System
import Monad
import Data.Maybe
import Data.List
import Data.Char (toLower)
Why can I run (runghc) some Haskell scripts but I cannot seem to
compile them?
e.g. http://www.haskell.org/all_about_monads/examples/example25.hs
I've changed the import listing to the following:
import IO
import System
import Monad
import Data.Maybe
import Data.List
import Data.Char (toLower)
Did you try ghc --make?
On Thu, Nov 12, 2009 at 3:12 PM, Casey Hawthorne cas...@istar.ca wrote:
Why can I run (runghc) some Haskell scripts but I cannot seem to
compile them?
e.g. http://www.haskell.org/all_about_monads/examples/example25.hs
I've changed the import listing to the following:
On Wed, 11 Nov 2009 00:37:59 -0800
John == John Meacham j...@repetae.net wrote:
Hi John,
John Yup. This was a major goal. compiling for iPhones and embedded
John arches is just as easy assuming you have a gcc toolchain set up.
John (at least with the hacked iPhone SDK.. I have never tried it
Hi, all,
Hackage shows a log failure for 'bindings-gsl':
Configuring bindings-gsl-0.1.1...
cabal-setup: At least the following dependencies are missing:
bindings-DSL ==1.0.*
But here is, at version 1.0.1, no building problems:
http://hackage.haskell.org/package/bindings-DSL
Shazam!
Thank you!
On Thu, 12 Nov 2009 15:13:47 -0500, you wrote:
Did you try ghc --make?
On Thu, Nov 12, 2009 at 3:12 PM, Casey Hawthorne cas...@istar.ca wrote:
Why can I run (runghc) some Haskell scripts but I cannot seem to
compile them?
e.g.
On Thu, Nov 12, 2009 at 8:52 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
I just meant it's not immediately clear how
foo :: forall x. (x - x - y)
is different from
foo :: (forall x. x - x) - y
It takes a bit of getting used to.
That still confuses me.
David Virebayre wrote:
On Thu, Nov 12, 2009 at 8:52 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
I just meant it's not immediately clear how
foo :: forall x. (x - x - y)
is different from
foo :: (forall x. x - x) - y
It takes a bit of
Hello,
sure, your program could use a database with HDBC. But I'll guess
(since you love static typing so much) you dislike formulating queries
in strings and to check the positions of your ?-placeholders and to
convert your values with fromSql/toSql. Maybe you would prefer
for your select query
Andrew Coppin wrote:
I just meant it's not immediately clear how
foo :: forall x. (x - x - y)
is different from
foo :: (forall x. x - x) - y
Uhm, I guess you meant
foo :: forall x. ((x - x) - y)
VS.
foo :: (forall x. x - x) - y
, didn't you?
I just meant it's not immediately clear how
foo :: forall x. (x - x - y)
is different from
foo :: (forall x. x - x) - y
It takes a bit of getting used to.
Those are different functions all together, so perhaps you meant these.
foo :: forall x y. (x - x) - y
bar :: forall y.
Anakreon Mendis anakreon at csd.auth.gr writes:
I've installed the flow2dot utility. It fails to produce a dot
file from the sample provided by it's author. The output of the program
is:
[skip]
Are you sure you are using version 0.7, since this is when order directive
came into existence?
On Nov 12, 2009, at 2:02 PM, Evan Laforge wrote:
Recently the go language was announced at golang.org.
It looks a lot like Limbo; does it have Limbo's dynamic loading?
According to Rob Pike, the main reason for 6g's speed
It's clear that 6g doesn't do as much optimisation as gccgo.
It
On Thu, Nov 12, 2009 at 2:57 AM, Neil Mitchell ndmitch...@gmail.com wrote:
Hi,
I'd really love a faster GHC! I spend hours every day waiting for GHC,
so any improvements would be most welcome.
Has anyone built a profiling enabled GHC to get data on where GHC spends
time during compilation?
Running GHC in parallel with --make would be nice, but I find on
Windows that the link time is the bottleneck for most projects.
Yes, when GHC calls GNU ld, it can be very costly. In my experience, on a
This is also my experience. GNU ld is old and slow. I believe its
generality also hurts
Why in a pattern match like
score (1 3) = 7
can I not have
sizeMax = 3
score (1 sizeMax) = 7
--
Regards,
Casey
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Nov 12, 2009, at 21:15 , Casey Hawthorne wrote:
Why in a pattern match like
score (1 3) = 7
can I not have
sizeMax = 3
score (1 sizeMax) = 7
Because it's a pattern, and when you introduce a symbol you are
inviting the pattern match to bind what it matched to that name for
use
Casey,
Why in a pattern match like
score (1 3) = 7
You probably mean
score 1 3 = 7
which applies the function 'score' to two arguments. With the parentheses,
it looks like an application of '1' to the argument '3'. But to answer your
actual question...
can I not have
sizeMax = 3
This worked for me, though that was quite a while ago. Presumably it
still works. I don't remember doing any magic, just using the Maemo
cross-compiler to build the output of jhc.
The only annoying part was having to build with jhc outside the
scratchbox environment and then build the C
Hello everyone.
What about passing complex c-types (structures) to c-functions.
More detailed: I have an application in production which was written in
Delphi. IT has ability to create pluggable modules to it. Interface
realized by sending Win32Api messages to application.
function in haskell
Christoph == Christoph Bauer i...@christoph-bauer.net writes:
Christoph Hello, sure, your program could use a database with
Christoph HDBC. But I'll guess (since you love static typing so
Christoph much) you dislike formulating queries in strings and to
Christoph check the
On 13/11/09 01:52, Evan Laforge wrote:
Running GHC in parallel with --make would be nice, but I find on
Windows that the link time is the bottleneck for most projects.
Yes, when GHC calls GNU ld, it can be very costly. In my experience, on a
This is also my experience. GNU ld is old and
On 13/11/09 05:31, Vasiliy G. Stavenko wrote:
Hello everyone.
What about passing complex c-types (structures) to c-functions.
More detailed: I have an application in production which was written in
Delphi. IT has ability to create pluggable modules to it. Interface
realized by sending
On Thu, 12 Nov 2009 22:44:22 -0500
Braden == Braden Shepherdson braden.shepherd...@gmail.com
wrote:
Braden This worked for me, though that was quite a while ago.
Braden Presumably it still works. I don't remember doing any magic,
Braden just using the Maemo cross-compiler to build the output of
Jason Dagit da...@codersbase.com writes:
Running GHC in parallel with --make would be nice, but I find on
Windows that the link time is the bottleneck for most projects.
Yes, when GHC calls GNU ld, it can be very costly. In my experience,
I'll add mine: On my Ubuntu systems, linking is
80 matches
Mail list logo
