Hi, I'm trying to get some better understanding of the theoretical foundations
behind Haskell. I wonder, where exactly does Haskell type system fit within the
lambda cube? http://en.wikipedia.org/wiki/Lambda_cube
I guess it could also vary depending on what extensions are turned on.
Thanks,
Haskell has terms depending on types (polymorphic terms) and types
depending on types (type families?), but no dependent types.
2009/5/24 Petr Pudlak d...@pudlak.name:
Hi, I'm trying to get some better understanding of the theoretical foundations
behind Haskell. I wonder, where exactly does
On Sun, May 24, 2009 at 12:18:40PM +0400, Eugene Kirpichov wrote:
Haskell has terms depending on types (polymorphic terms) and types
depending on types (type families?), but no dependent types.
But how about undecidability? I'd say that lambda2 or lambda-omega have
undecidable type checking,
2009/5/24 Petr Pudlak d...@pudlak.name:
On Sun, May 24, 2009 at 12:18:40PM +0400, Eugene Kirpichov wrote:
Haskell has terms depending on types (polymorphic terms) and types
depending on types (type families?), but no dependent types.
But how about undecidability? I'd say that lambda2 or
2009/5/24 Petr Pudlak d...@pudlak.name:
If all Haskell had would be HM, it would be System F.
That cannot be quite right, can it? System F has more powerful
polymorphism than HM.
Ciao,
Janis.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Duncan Coutts wrote:
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
Hello,
I want to get the top or the bottom elements of a graph, but the
following code appears to give the wrong answer in most cases, and the
right answer in a few cases. Any ideas?
-- get the most general or the least general elements
graphMLGen :: Bool - Gr [Rule] () - Gr [Rule] ()
On Saturday 23 May 2009 23:23:05 Henning Thielemann wrote:
Interesting solution however it does not perform very nice. I wrote
microbenchmark
... skipped ...
I didn'd do any profiling so I have no idea why writing is so slow.
If you use top-level definition 'xs' the program might
On Sun, 2009-05-24 at 12:04 +0100, Dominic Steinitz wrote:
I'll add this issue to the FAQ, it come up enough. If anyone else
reading would like to eliminate this FAQ, then implementing this ticket
is the answer:
suggest use of --user if configure fails with missing deps that
On Sat, 2009-05-23 at 19:57 -0500, br...@lorf.org wrote:
On Saturday, 23.05.09 at 17:26, Don Stewart wrote:
http://haskell.org/haskellwiki/Package_versioning_policy ?
That helps a lot. I should have found that. But putting the policy on a
web page doesn't seem to be working; there are a
On Sat, 2009-05-23 at 20:42 -0400, Mario Blažević wrote:
On Sat 23/05/09 2:51 PM , Duncan Coutts duncan.cou...@worc.ox.ac.uk sent:
On Sat, 2009-05-23 at 13:31 -0400, Mario Blažević wrote:
...
So the function is not strict, and I don't understand
why GHC should evaluate the arguments
There's a nice website for HPC but it looks a bit out of date.
http://projects.unsafeperformio.com/hpc/
I wanted to send a patch to the FAQ for using HPC with .lhs files (you
have to run ghc -E to generate .hs files and strip some of the the lines
ghc generates: {-# LINE 1 ASNTYPE.lhs #-} #line
I recommend using -ddump-simpl, as it produces more readable output.
Actually, I can't see any effect of that pragma in the
core files whatsoever, but it certainly has effect on
run time.
How about diffing the whole core output (and using -ddump-simpl). If
there's a performance
Is there a list of projects that will be worked on during this, or how will
that work?
On Thu, May 21, 2009 at 5:39 PM, Brent Yorgey byor...@seas.upenn.eduwrote:
Hi all!
We are in the early stages of planning a Haskell hackathon/get
together, Hac φ, to be held this summer at the University
On Sun, 2009-05-24 at 12:48 -0400, Mario Blažević wrote:
How about diffing the whole core output (and using -ddump-simpl). If
there's a performance difference then there must be a difference in the
core code too.
I can't exactly use diff because the generated identifier names are not the
On the IRC channel a few days ago, it was said that, as long
as we allow `seq`, Hask is not a valid category.
Doesn't this basically mean that a very large amount of
Haskell -- anything with strictness annotations -- can not be
described in a category Hask?
--
Jason Dusek
Hans van Thiel wrote:
Hello,
I want to get the top or the bottom elements of a graph, but the
following code appears to give the wrong answer in most cases, and the
right answer in a few cases. Any ideas?
-- get the most general or the least general elements
graphMLGen :: Bool - Gr [Rule]
jason.dusek:
On the IRC channel a few days ago, it was said that, as long
as we allow `seq`, Hask is not a valid category.
Doesn't this basically mean that a very large amount of
Haskell -- anything with strictness annotations -- can not be
described in a category Hask?
I'm not
Hello all,
I have been exposed to a problem that have happened to others too, and
since I have found a (scary) solution with the help of Duncan Coutts,
I'm now sharing it with you.
The reason I wanted to pass specific CPP flags to haddock was to allow
the documentation of the full
I'm pleased to announce the release of bsd-sysctl 1.0.3, a package that
provides a System.BSD.Sysctl module allowing access to the C sysctl(3)
API.
It should fully work on FreeBSD, NetBSD and Mac OS X platforms; it
should also work on OpenBSD and Linux, although looking up sysctl's by
name isn't
Design-by-negativity can *be* a way of being creative.
I've lost count of the number of times that I've been
explaining to someone why something can't be done, and
suddenly realised that one of the reasons was invalid
and seen how to do it.
The key is not whether you explore the design space
andrewcoppin:
The problem seems to boil down to this: The Binary instance for
Double (and Float, by the way) is... well I guess you could argue
it's very portable, but efficient it isn't. As we all know, an
IEEE-754 double-precision floating-point number occupies 64 bits;
1 sign bit, 11
Richard O'Keefe wrote:
Design-by-negativity can *be* a way of being creative.
I've lost count of the number of times that I've been
explaining to someone why something can't be done, and
suddenly realised that one of the reasons was invalid
and seen how to do it.
The key is not whether you
The main objection I have to the negative process (can't be done) is that is
so often bogus. Proof by lack of imagination. I guess it works for
Richard, though not for Michael's architect, because Richard is able to
catch his bogus reasoning *and he is willing*** to do so, which requires
24 matches
Mail list logo
