#3370: Put DiffArray in its own diffarray package
--+-
Reporter: igloo |Owner: igloo
Type: proposal | Status: new
Priority: normal |
#2727: DiffArray performance unusable for advertized purpose
-+--
Reporter: claus |Owner:
Type: run-time performance bug | Status: closed
#1259: Accessing undefined value in DiffArray returns misleading error message
-+--
Reporter: guest |Owner:
Type: bug | Status: closed
#3410: ghc fails to parse versioned GPL and LGPL license from package
configuration
-+--
Reporter: int-e | Owner:
Type: bug | Status: new
#2781: Install permissions broken
+---
Reporter: guest|Owner:
Type: bug | Status: closed
Priority: normal |
#3411: Extra file in snapshots from HEAD branch
-+--
Reporter: kristerw | Owner:
Type: bug | Status: new
Priority: normal|
#3412: the 'impossible' happened (expectJust chooseExternalIds)
-+--
Reporter: int-e | Owner:
Type: bug | Status: new
Priority: normal
#3411: Extra file in snapshots from HEAD branch
-+--
Reporter: kristerw |Owner:
Type: bug | Status: closed
Priority: normal|
#3410: ghc fails to parse versioned GPL and LGPL license from package
configuration
--+-
Reporter: int-e | Owner:
Type: bug | Status: new
#3409: type variable out of scope in worker/wrapper transformation
--+-
Reporter: judahj| Owner: chak
Type: bug | Status: new
Priority: normal
Hello, I'm quite new to Haskell, but experienced in other languages (C,
Python, Ruby, SQL, etc). I am interested in Haskell because I've heard
that the language is capable of lots of optimizations based on laziness,
and I want to learn more about that.
I dug in with Project Euler problem #1, and
Josh,
In general you'll find the haskell-cafe (haskell-c...@haskell.org) to
be a more lively place for this type of discussion, but since we're
here I might as well mention that memory use of a Haskell function is
one of the hardest things to gain an understanding about.
main = print (show (sum
Hi Thomas, thanks for the reply!
Thomas DuBuisson thomas.dubuisson at gmail.com writes:
Josh,
In general you'll find the haskell-cafe (haskell-cafe at haskell.org) to
be a more lively place for this type of discussion
Good to know, I just wasn't sure if it was appropriate for
GHC-specific
joshua:
Hello, I'm quite new to Haskell, but experienced in other languages (C,
Python, Ruby, SQL, etc). I am interested in Haskell because I've heard
that the language is capable of lots of optimizations based on laziness,
and I want to learn more about that.
I dug in with Project Euler
Hello Joshua,
Sunday, August 2, 2009, 11:45:57 AM, you wrote:
94,604 bytes allocated in the heap
Is there any way I could find out what these 94kb of RAM were
allocated for? This seems high -- my entire program's working set
is 6kb.
as Don said, compiled code works on Int#
bulat.ziganshin:
Hello Joshua,
Sunday, August 2, 2009, 11:45:57 AM, you wrote:
94,604 bytes allocated in the heap
Is there any way I could find out what these 94kb of RAM were
allocated for? This seems high -- my entire program's working set
is 6kb.
as Don said,
dons:
Showing what transformations happened. Notably, 2 occurences of the
streamU/unstreamU
transformation, to remove intermediate structures.
The final code looks like:
$s$wfold :: Int# - Int#
$s$wfold =
\ (sc_s19l :: Int#) -
case modInt# (-9223372036854775807) 3 of
Joshua Haberman jos...@reverberate.org writes on 2 Aug 2009
Hello, I'm quite new to Haskell, but experienced in other languages (C,
Python, Ruby, SQL, etc). I am interested in Haskell because I've heard
that the language is capable of lots of optimizations based on laziness,
and I want to
Antoine Latter wrote:
I was trying to see what GHC head was like, but I've run into a few
snags compiling packages.
There's a discrepancy between ghc and ghc-pkg that causes this.
See http://hackage.haskell.org/trac/ghc/ticket/3410
My existing binary for cabal-install can install quite a few
Hello,
I'm interested in research relating to memory management in
Haskell. I'm at the point where I don't know enough to have very
specific questions, but I'm especially interested in garbage collection
in Haskell, and any available statistics (such as, how long does a thunk
typically
nricci01:
Hello,
I'm interested in research relating to memory management in
Haskell. I'm at the point where I don't know enough to have very
specific questions, but I'm especially interested in garbage collection
in Haskell, and any available statistics (such as, how long does a
I updated the code on the wiki page: the previous version didn't handle
prefix negation - did you implement that yourself in HLint?
No, I didn't implement prefix negation in HLint - it never came up as
an issue. Perhaps the underlying HSE library dealt with it for me -
Niklas would know.
In
Michal D. wrote:
I'm in the process of writing a toy compiler but I'm having some
trouble trying to make my datatypes general. For example, using parsec
I parse statements as:
data Stmt = SIf Test [Stmt] [Stmt] | ...
However, when it's time to create a control flow graph it would be
Hi all,
It's been a while since I announced anything about the project on the
list, but I've been regularly posting about it on my blog [1]. Everyone
should feel encouraged to check out the cabalised code [2] and play with
it, stress test it. Adventurous ones can also look at the source. ;)
are you a student (undergrad or grad) or faculty (junior or senior)? These
are all very different scenarios and accordingly different goals are
realistic.
For example, if you're a student, it might be more realistic to start with
finding a professor who will be willing to supervise an
On Sun, Aug 02, 2009 at 08:36:27AM -0400, Carter Schonwald wrote:
are you a student (undergrad or grad) or faculty (junior or senior)? These
are all very different scenarios and accordingly different goals are
realistic.
I'm a faculty member (postdoc). I've been working in the field of
Have you considered say proposing a class on theorem proving that uses coq?
www.*coq*.inria.fr http://www.coq.inria.fr . Such a class would entail
teaching how to program using the coq term language, which is itself a pure
functional language, albeit one with some restrictions related to
That's actually a good idea. I haven't considered this alternative so far,
probably because I have always been working with first-order theorem provers.
But I guess eventually I'll merge my interests in ATP and FP and start doing
some serious work with higher-order theorem provers like coq or
Call for Papers and ParticipationIFL 2009Seton Hall UniversitySOUTH ORANGE, NJ, USAhttp://tltc.shu.edu/blogs/projects/IFL2009/Register at: http://tltc.shu.edu/blogs/projects/IFL2009/registration.html* NEW *Registration and talk submission extended to August 23, 2009! ***The
Hi,
Now that I've understood how to generate raster points of a line in Haskell -
the next thing I want to do is generate a pnm file with it. I've done it in
perl as of now. In perl, I can have a scalar variable $x contain a string of
256*256*3 bytes (for 24-bit 256x256 image) and set pixels
On Sun, Aug 2, 2009 at 4:00 PM, CK Kashyap ck_kash...@yahoo.com wrote:
Hi,
Now that I've understood how to generate raster points of a line in Haskell
- the next thing I want to do is generate a pnm file with it. I've done it
in perl as of now. In perl, I can have a scalar variable $x contain
On Sun, Aug 2, 2009 at 12:25, Petr Pudlakd...@pudlak.name wrote:
Hi all,
I'd like to convince people at our university to pay more attention to
functional languages, especially Haskell. Their arguments were that
(1) Functional programming is more academic than practical.
Which, even
On Sun, 2009-08-02 at 12:25 +0200, Petr Pudlak wrote:
(2) is harder for me, since I've never programmed in Prolog or another
language
for logic programming. I'd be happy if anyone who is experienced in both
Prolog
and Haskell could elaborate the differences, pros cons etc.
I have done
Hello Bill,
Monday, August 3, 2009, 12:01:27 AM, you wrote:
I have done some real-world programming in Prolog and SML. The
conventional wisdom in the LP community seems to be that the primary
path to performance improvement of logic programs is by reduction of
non-determinism.
and the
andrewcoppin:
Don Stewart wrote:
We're pleased to announce the third release of the Haskell Platform: a
single, standard Haskell distribution for everyone.
The specification, along with installers (including Windows and Unix
installers for a full Haskell environment) are available.
On Mon, Aug 3, 2009 at 1:41 AM, Don Stewart d...@galois.com wrote:
* Improvements to crazy popular Windows installer
Are you kidding or are indeed many Windows users playing with Haskell these
days?
Cheers,
Peter
___
Haskell-Cafe mailing list
bugfact:
On Mon, Aug 3, 2009 at 1:41 AM, Don Stewart d...@galois.com wrote:
* Improvements to crazy popular Windows installer
Are you kidding or are indeed many Windows users playing with Haskell these
days?
No, literally,
On Sun, Aug 2, 2009 at 6:25 AM, Petr Pudlak d...@pudlak.name wrote:
Hi all,
I'd like to convince people at our university to pay more attention to
functional languages, especially Haskell. Their arguments were that
(1) Functional programming is more academic than practical.
(2) They
I'm pleased to announce the release of yst, now available on HackageDB.
yst generates static websites from YAML or CSV data files and
StringTemplates. This approach combines the speed, security, and ease of
deployment of a static website with the flexibility and maintainability
of a dynamic site
newtype StmtRec = StmtRec (Stmt [StmtRec])
That's pretty much were I threw in the towel last night. Except I had
a bunch of places where I had to add the extra constructor statements.
I wish there was a solution that didn't require these... they really
butcher pattern matching clarity.
I would have thought that a major motivation for the study of haskell,or for
that matter ML, Clean, would be their type systems: statically typed higher
order parametric polymorphism which is certainlly different enough from that
of prolog to warrant study. So from the perspective of type
Hi Thomas,
No, unfortunately the documentation is limited to the sparse Haddock
comments. We intend to assemble more detailed examples, but our
program is consuming all our time at the moment. With the limited
documentation, frankly I was a bit surprised folks where able to pick
it up and run
Thanks Sebastian,
ppm module is indeed very useful. So, I guess my question then just boils down
to, how can I write a function to mimic the setPixel function -
Basically, a blank white image would look like this (as per ppm module)
[
[ (255, 255, 255) , (255, 255, 255) , (255, 255, 255)
43 matches
Mail list logo
