You will be more likely to get an answer on the ghc-users mailing list
(cc'ed). The ghc developers rarely follow -cafe.
On 1 Jan 2011, at 20:36, Jane Ren wrote:
Hi,
Does anyone know what GHC module gets the AST and type info of some
source code? This is the GHC module that converts all
On Sun, Jan 2, 2011 at 11:48 PM, C K Kashyap ckkash...@gmail.com wrote:
Hi,
I found this nice video on monads (although for clojure).
http://www.youtube.com/watch?v=ObR3qi4Guys
Question - in the video, if I understood right, the guy implements
return as a function that takes a value and
This happens because haskel98-1.1.0.0 can't be built with GHC 6.12,
but lacks the proper version constraints to enforce this. If you add
'--constraint=haskell98==1.0.*' to your 'cabal install' command, it
will probably work.
Erik
On Mon, Jan 3, 2011 at 01:08, Matthew Fairtlough
On Fri, Dec 17, 2010 at 12:08:53PM +0300, Eugene Kirpichov wrote:
Hello!
Actually the presentation was created in PowerPoint, not in TeX :)
You can download the PDF here -
http://www.slideshare.net/jkff/two-visualization-tools/download
(however one has to be logged in to Slideshare, for
Thanks, I didn't know about the issue with haskell98-1.1 and that's
sorted it out.
Matthew.
On 03/01/2011 09:33, Erik Hesselink wrote:
This happens because haskel98-1.1.0.0 can't be built with GHC 6.12,
but lacks the proper version constraints to enforce this. If you add
Thanks Luke,
A functor is a special kind of one parameter type constructor, that
has one of these mapping operations (called fmap). It means that
they treat their parameter in a particular way, roughly that they do
something kind of like returning it rather than depending on it. Note
that
Hi!
I'am trying to express a happstack component like the simplified one here:
https://gist.github.com/763597
What exactly is the problem for the compiler?
Is there a better way to describe such a abstract or parametrized component?
Regards
alios
Alex Kropivny alex.kropi...@gmail.com wrote:
Could something like code abstraction be done instead?
Haskell lends itself to solving problems in really generic, high level
ways that reveal a LOT about the underlying problem structure. Through
some combination of descriptive data types,
I don't think such abstractions are currently possible in Happstack,
but I'm CCing the happstack list to see if they have anything to add.
Happstack state methods require monomorphic types, as far as I've ever known.
Antoine
On Mon, Jan 3, 2011 at 10:00 AM, Markus Barenhoff al...@alios.org
Hi all,
I do some work on Ben Lippmeier's DDC compiler and when profiling
DDC compiling a program with 11 source code files (much like ghc
--make), we get a memory usage graph like this:
http://www.mega-nerd.com/tmp/ddc-heap-usage-20101231.png
We have no particular problem with the 11 peaks
Hi Stephen,
On 2 January 2011 13:35, Stephen Tetley stephen.tet...@gmail.com wrote:
Can a lazy cons be implemented for (infinite) Streams in the
Stream-Fusion style?
I made a mailing list post about almost exactly this issue a while ago
On Sun, 02 Jan 2011 18:09:05 +0100
Karel Gardas karel.gar...@centrum.cz wrote:
I'd like to compile more recent than 6.8.2 GHC on itanium-linux system I
do have access to, but I'm kind of unlucky with this. I'm trying
unregisterised build (of 6.12.3 and 6.10.4) and it always fails with:
When using Java, one can tell javadoc to generate documentation for
all members of a class, including private and protected members. This
is useful for generating internal documentation (for instance). Is
there a similar way in Haddock to produce documentation for functions
and types that are not
For this I use:
'cabal haddock --internal'
Antoine
On Mon, Jan 3, 2011 at 2:39 PM, Edward Amsden eca7...@cs.rit.edu wrote:
When using Java, one can tell javadoc to generate documentation for
all members of a class, including private and protected members. This
is useful for generating
2011/1/3 Antoine Latter aslat...@gmail.com:
For this I use:
'cabal haddock --internal'
Or if you're using haddock directly it's: --ignore-exports.
David
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi all,
I would like to use freeglut instead of GLUT for my Haskell OpenGL
program, but when I place the freeglut dll in the program's directory
and try to run the program on Windows XP, I get the following error message:
user error (unknown GLUT call glutSetOption, check for freeglut)
Could a subreddit of some kind be used for this, or is a new site necessary?
I can see a subreddit where people vote for problems they'd like to see
elegant solutions to, then solutions are in the replies and get voted on.
Might be tricky for larger solutions (you'd have to move them to git/gist
On Mon, Jan 3, 2011 at 5:47 PM, Alex Kropivny alex.kropi...@gmail.com wrote:
Could a subreddit of some kind be used for this, or is a new site necessary?
Or maybe a stackexchange. While they are publicly going for big
official branding sites, I get the impression that they would be
open to a
Thanks for the detailed response...
On Thu, Dec 30, 2010 at 9:54 AM, Conor McBride
co...@strictlypositive.orgwrote:
On 28 Dec 2010, at 23:29, Luke Palmer wrote:
Eta conversion corresponds to extensionality; i.e. there is nothing
more to a function than what it does to its argument.
I think
On Monday 03 January 2011 9:23:17 pm David Sankel wrote:
The following is a dependent type example where equality of open terms
comes up.
z : (x : A) → B
z = ...
w : (y : A) → C
w = z
Here the compiler needs to show that the type B, with x free,
is equivalent to C, with y free. This
On Tue, Jan 4, 2011 at 1:49 AM, Ben Millwood hask...@benmachine.co.uk wrote:
haskell-src-meta is a package originally written by Matt Morrow to
provide a translation from the syntax tree provided by
haskell-src-exts to template haskell syntax. Essentially this allows
TH code to be parsed from
David,
Conor wrote:
But the news is not all bad. It is possible to add some eta-rules
without breaking the Geuvers property (for functions it's ok; for
pairs and unit it's ok if you make their patterns irrefutable).
Note that, in Haskell, for functions it's only ok if you leave seq and the
22 matches
Mail list logo
