#1012: ghc panic with mutually recursive modules and template haskell
--+-
Reporter: guest | Owner:
Type: bug | Status: reopened
Priority: normal|
#1012: ghc panic with mutually recursive modules and template haskell
--+-
Reporter: guest | Owner:
Type: bug | Status: reopened
Priority: normal|
#1944: round function causes cblas NaNs
---+
Reporter: SevenThunders | Owner:
Type: bug| Status: new
Priority: normal | Milestone: 6.8.3
Component:
#1898: segfault with +RTS -N2 (related to tryTakeMVar?)
+---
Reporter: j.waldmann | Owner: simonmar
Type: bug | Status: new
Priority: high| Milestone: 6.8.3
#2013: ghci crash on startup: R_X86_64_32S relocation out of range.
-+--
Reporter: mboes| Owner:
Type: bug | Status: new
Priority: normal | Milestone:
#1999: panic with GADT etc.
--+-
Reporter: jeltsch | Owner: chak
Type: bug | Status: new
Priority: normal| Milestone: 6.10 branch
Component: Compiler |
#1898: segfault with +RTS -N2 (related to tryTakeMVar?)
+---
Reporter: j.waldmann | Owner: igloo
Type: merge | Status: new
Priority: high| Milestone: 6.8.3
Component:
#2006: unreachable GADT pattern clauses show up as warnings with -Wall
--+-
Reporter: ryani | Owner:
Type: bug | Status: new
Priority: normal| Milestone:
Hi Christian,
On Thu, Jan 03, 2008 at 02:41:56PM +0100, Christian Maeder wrote:
Judah's framework (2342543 Bytes)
http://www.math.ucla.edu/~jjacobson/ghc/GNUreadline-framework.zip
should replace (my old one)
http://www.haskell.org/ghc/dist/mac_frameworks/GNUreadline-framework.zip
Done!
#595: Overhaul GHC's overlapping/non-exhaustive pattern checking
--+-
Reporter: simonmar | Owner:
Type: task | Status: new
Priority: normal|
#2000: -funfolding-update-in-place badly documented
--+-
Reporter: m4dc4p| Owner: igloo
Type: merge | Status: new
Priority: normal| Milestone: 6.8.3
Component: Compiler
#2011: [6.8.1 regression] panic: lookupVers1 base:GHC.Prim sym{tc}
--+-
Reporter: simonmar | Owner: igloo
Type: merge | Status: new
Priority: high | Milestone: 6.8.3
#793: Use gcc's libffi to replace Adjustor.c and ByteCodeFFI.hs?
+---
Reporter: simonmar| Owner: simonmar
Type: task| Status: new
Priority: normal
#1395: let ./configure check for a GNUreadline framework
-+--
Reporter: [EMAIL PROTECTED]| Owner:
Type: feature request | Status: reopened
Priority: normal |
#1395: let ./configure check for a GNUreadline framework
-+--
Reporter: [EMAIL PROTECTED]| Owner:
Type: feature request | Status: reopened
Priority: normal |
#1987: GHCi's config file in AppData\ghc folder on Windows
-+--
Reporter: felixmar | Owner:
Type: feature request | Status: new
Priority: low |
Hello,
Thanks everybody. However, I believe that using a modified readline library is
debatable, mainly because it adds the burden of keeping this library
up-to-date to the GHC maintenance process. Having a renamed library is one
thing and it does not seem that also modifying the contents of
#1958: collect2: ld terminated with signal 10 [Bus error]: Building parsec on a
PPC Mac OS X 10.5 Leopard as part of GHC 6.9
-+--
Reporter: thorkilnaur | Owner: thorkilnaur
Type: bug |
Isaac Dupree wrote:
linking the compiled stage2 failed when bootstrapping from 6.6.1, with
--prefix=$HOME .
It's odd because I previously had a 6.8.2 (official x86 Linux bin-dist)
installed as root (it's gone now), and I still have a bunch of
cabal/hackage packages installed in $HOME that
Simon Marlow wrote:
Isaac Dupree wrote:
linking the compiled stage2 failed when bootstrapping from 6.6.1, with
--prefix=$HOME .
It's odd because I previously had a 6.8.2 (official x86 Linux
bin-dist) installed as root (it's gone now), and I still have a bunch
of cabal/hackage packages
Walt Rorie-Baety wrote:
Maybe I'm just too new at this, but the GCH FAQ entry for readline in
GHCi is confusing for me. Especially since it ends with the sentence
Instructions for GHC 6.2.2. are here. However, as the quote goes,
there's no 'here' here. - the location of the instructions are
Isaac Dupree wrote:
Simon Marlow wrote:
Isaac Dupree wrote:
linking the compiled stage2 failed when bootstrapping from 6.6.1,
with --prefix=$HOME .
It's odd because I previously had a 6.8.2 (official x86 Linux
bin-dist) installed as root (it's gone now), and I still have a bunch
of
I've no objection to renaming it, if that's more convenient. It's a kind of
composition operator, hence the name. Perhaps :? By all means send, or
commit, a patch
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of
| Neil Mitchell
| Sent: 31
Hi,
can someone explain the linking error below? (on Intel-Mac (Tiger?))
Preprocessing library HDBC-sqlite3-1.1.3.0...
Building HDBC-sqlite3-1.1.3.0...
[1 of 7] Compiling Database.HDBC.Sqlite3.Consts ( dist/build/Database/
HDBC/Sqlite3/Consts.hs, dist/build/Database/HDBC/Sqlite3/Consts.o )
[2 of
Hello,
Why is it that the haddock docs supplied with GHC omit this module and
its exports? Is it because we're not supposed to use them? I'm thinking
of the compareInt# function in particular, which I use quite a lot.
Thanks
--
Adrian Hey
___
On 3-Jan-08, at 4:47 PM, Christian Maeder wrote:
Hi,
can someone explain the linking error below? (on Intel-Mac (Tiger?))
Preprocessing library HDBC-sqlite3-1.1.3.0...
Building HDBC-sqlite3-1.1.3.0...
[1 of 7] Compiling Database.HDBC.Sqlite3.Consts ( dist/build/Database/
Hi
Simon Marlow wrote:
i.e. qualify most things, but selectively import a few things unqualified.
The GHC API is quite huge, I expect clashes to be fairly common if you
import it unqualified.
On 1/3/08, Simon Peyton-Jones [EMAIL PROTECTED] wrote:
I've no objection to renaming it, if that's
Hi Victor,
-package-name base
should do the thing
Thanks very much, that is the correct flag to allow built in syntax.
However, turning that flag on also does other stuff, which breaks new
things. Taking the module Prelude.hs, from a darcs checkout of the
libraries:
Hi, Neil--
On 1/3/08, Neil Mitchell [EMAIL PROTECTED] wrote:
Hi Victor,
-package-name base
should do the thing
Thanks very much, that is the correct flag to allow built in syntax.
However, turning that flag on also does other stuff, which breaks new
things. Taking the module
Simon Marlow wrote:
Isaac Dupree wrote:
Simon Marlow wrote:
Isaac Dupree wrote:
linking the compiled stage2 failed when bootstrapping from 6.6.1,
with --prefix=$HOME .
It's odd because I previously had a 6.8.2 (official x86 Linux
bin-dist) installed as root (it's gone now), and I still
Hello GHC people,
I was trying my hand at some GHC hacking, and I couldn't help but notice
that much of the code looks (IMHO) horrible. There are some things that look
as if they haven't been touched since the Haskell 1.3 days. The most
striking is the use of `thenXX` instead of do notation.
The GC discards an MVar when there are only blocked readers on it. But there
can be any number of blocked readers. So long as the read remains in the
future, however, the GC doesn't recover it, because it has no way to know that
the thread will only read it and not write it.
Your idea of
[EMAIL PROTECTED] wrote:
One thing that hasn't come up yet is that empty instance declarations
are the only decent option (that I know of) that we have in the
absence of real class aliases.
It does seem to me that compilers could reasonably distinguish between
incomplete definition:
class
Hello Simon,
For the record: I assume that by Boehm's article on finalisers you
mean:
@inproceedings{DBLP
http://www.informatik.uni-trier.de/%7Eley/db/about/bibtex.html
:conf/popl/Boehm03,
author= {Hans-Juergen Boehm},
title = {Destructors, finalizers, and synchronization},
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Dear all, I'm looking for a Data.Tree.drawTree
that is a bit more spacefilling (put some subtrees side by side).
Thanks - Johannes Waldmann, Leipzig.
-BEGIN PGP SIGNATURE-
Version: GnuPG v2.0.4-svn0 (GNU/Linux)
Comment: Using GnuPG with
Hi Jonathan,
I wrote:
So in what way are Set morphisms restricted from being
Hask morphisms?
Jonathan Cast wrote:
The normal view taken by Haskellers is that the denotations of
Haskell types are CPPOs.
CPPO?
So:
(1) Must be monotone
(2) Must be continuous
Could you please define what
I was thinking more along type classesand then I was going to throw
some spanners in the works
From: Ryan Ingram [mailto:[EMAIL PROTECTED]
Sent: 02 January 2008 17:41
To: Nicholls, Mark
Cc: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Is there
...is a paper about automatic specialisation of functions by unboxing
arguments, one could say. I'm only on page 6, but already survived the
first formalisms, which is bound to mean that the rest of the paper is
likewise accessible, as hinted on at ltu.
http://www.cs.nott.ac.uk/~gmh/wrapper.pdf
[snip]
-- C#: interface IX1 { String foo1(int); }
class IX1 obj where
foo1 :: Int - obj - String
Yep...I think that's what I'd dothough I would have done...
foo1 :: obj - Int - String
Does that matter?
-- C#: interface IX2A { String foo2(A); }
class IX2 obj a where
foo2 :: a - obj
Can you give me a summary of why it's meaningless.both would seem to
describe/construct values/objectsthey may not be equivalent, but I
would expect some considerable overlap.
-Original Message-
From: Bulat Ziganshin [mailto:[EMAIL PROTECTED]
Sent: 02 January 2008 20:29
To:
Hello Mark,
Thursday, January 3, 2008, 1:22:26 PM, you wrote:
because they have different models. i recommend you to start from
learning this model, otherwise you will don't understand how Haskell
really works and erroneously apply your OOP knowledge to Haskell data
structures.
shortly said,
On Thu, 6 Dec 2007, Henning Thielemann wrote:
On Thu, 6 Dec 2007, Thomas Hartman wrote:
On a related note... is there some easy way to be sure that a program I am
compiling uses only haskell 98? (Because any pure haskell 98 should always
compile on yhc... right?)
You can for instance
Achim Schneider [EMAIL PROTECTED] wrote:
[...]
I'm trying to grok that
[] = id
++ = .
in the context of Hughes lists.
I guess it would stop to slip away if I knew what : corresponds to.
--
(c) this sig last receiving data processing entity. Inspect headers for
past copyright information.
David Roundy wrote:
Anyhow, could you retry this test with the above change in methodology, and
let me know if (a) the pull is still slow the first time and (b) if it's
much faster the second time (after the reverse unpull/pull)?
I think I've done it in both directions now, and it got faster,
I loosely do understandbut very looselybut I'm not, as yet,
convinced it is completely relevant.
The implementation may differ, but that does not mean that there is no
overlapI am not expecting one model to be a superset of the other,
but I am expecting some sort of overlap between
This is an early release of Haskell bindings for the popular LLVM
compiler infrastructure project.
If you don't know what LLVM is, it's a wonderful toybox of compiler
components, from a complete toolchain supporting multiple architectures
through a set of well-defined APIs and IR formats that are
On Jan 3, 2008 6:08 AM, Achim Schneider [EMAIL PROTECTED] wrote:
Achim Schneider [EMAIL PROTECTED] wrote:
[...]
I'm trying to grok that
[] = id
++ = .
in the context of Hughes lists.
I guess it would stop to slip away if I knew what : corresponds to.
Well, (:) has type a - [a] -
Hi Mark,
foo1 :: Int - obj - String
Yep...I think that's what I'd dothough I would have done...
foo1 :: obj - Int - String
Does that matter?
Well, it's a good habit in Haskell to move the most important parameter to
the end of the argument list. See e.g.
Brent Yorgey [EMAIL PROTECTED] wrote:
Well, (:) has type a - [a] - [a], so a function corresponding to
(:) for Hughes lists should have type
foo :: a - H a - H a
[...]
I think the key sentence from the paper is this: by
representing a list xs as the function (xs ++) that appends this
Achim Schneider [EMAIL PROTECTED] wrote:
Brent Yorgey [EMAIL PROTECTED] wrote:
Well, (:) has type a - [a] - [a], so a function corresponding to
(:) for Hughes lists should have type
foo :: a - H a - H a
[...]
I think the key sentence from the paper is this: by
representing
Achim Schneider wrote:
Achim Schneider [EMAIL PROTECTED] wrote:
[...]
I'm trying to grok that
[] = id
++ = .
in the context of Hughes lists.
they are also known as difference lists, and also used at type String
in the Prelude as ShowS, to help avoid quadratic behavior when making
Ahh ok I see what is meant by the parameter order
-Original Message-
From: Peter Verswyvelen [mailto:[EMAIL PROTECTED] On Behalf Of
Peter Verswyvelen
Sent: 03 January 2008 12:02
To: Nicholls, Mark
Cc: haskell-cafe@haskell.org
Subject: RE: [Haskell-cafe] Is there anyone out there who
Achim Schneider wrote:
...is a paper about automatic specialisation of functions by unboxing
arguments, one could say. I'm only on page 6, but already survived the
first formalisms, which is bound to mean that the rest of the paper is
likewise accessible, as hinted on at ltu.
Achim Schneider [EMAIL PROTECTED] wrote:
(define (cons x y)
(lambda (m) (m x y)))
(define (car z)
(z (lambda (p q) p)))
(define (cdr z)
(z (lambda (p q) q)))
, which, just for completeness, can be of course also be done in
Haskell:
cons :: a - b - (a - b - c) - c
cons x y m
Looks good! I liked relational algebra much much more than SQL, so I'll
certainly have to look into that.
Thanks,
Peter
Justin Bailey wrote:
I can speak to haskelldb a little, see below:
On Jan 2, 2008 3:50 AM, Peter Verswyvelen [EMAIL PROTECTED] wrote:
·regarding Haskell and
Hi Benja,
I wrote:
By the type expression Integer - Integer
we mean all Haskell functions mapping Integers to Integers.
There are only countably many of those.
...
But that was not the context in this thread. The category
Hask that we often mention in discussions about Haskell
the
Hi,
It would be nice if you could package this and release it on hackage.
http://hackage.haskell.org/packages/hackage.html
I packaged it, perhaps you can have a look at it, if it is, what you thought...
When I get a username, I'll put it on hackage :)
--
H.
Jonathan Cast wrote:
The normal view taken by Haskellers is that the denotations of
Haskell types are CPPOs.
I wrote:
CPPO?
(1) Must be monotone
(2) Must be continuous
Could you please define what you mean by those terms
in this context?
Jens Blanck wrote:
The extra P would stand for
Peter Verswyvelen wrote:
Looks good! I liked relational algebra much much more than SQL, so I'll
certainly have to look into that.
I agree. I have not tried haskelldb yet, but I would
like to.
My impression from some previous posts is that
because of the high-level approach, it is difficult
On Thu, 3 Jan 2008, Achim Schneider wrote:
Henning Thielemann [EMAIL PROTECTED] wrote:
Sometimes I believed that I understand this reason, but then again I
do not understand. I see that left-associative (++) like in
((a0 ++ a1) ++ a2) ++ a3
would cause quadratic time. But (++) is
Hello Mark,
Thursday, January 3, 2008, 2:13:08 PM, you wrote:
of course *some* overlap exists but in order to understand it you
should know exact shape of both methods
when i tried to develop complex library without understanding t.c.
implementation, i constantly goes into the troubles - things
Am Donnerstag, 3. Januar 2008 14:48 schrieb Henning Thielemann:
On Thu, 3 Jan 2008, Isaac Dupree wrote:
Achim Schneider wrote:
Achim Schneider [EMAIL PROTECTED] wrote:
[...]
I'm trying to grok that
[] = id
++ = .
in the context of Hughes lists.
they are also known
Henning Thielemann [EMAIL PROTECTED] wrote:
I figure it's (constant vs. linear) vs. (linear vs. quadratic), for
more involved examples.
I can't see it. If I consider (x++y) but I do not evaluate any
element of (x++y) or only the first element, then this will need
constant time. If I
Henning Thielemann wrote:
Sometimes I believed that I understand this reason, but then again I do
not understand. I see that left-associative (++) like in
((a0 ++ a1) ++ a2) ++ a3
would cause quadratic time. But (++) is right-associative and 'concat' is
'foldr'. They should not scan the
On Thu, 3 Jan 2008, Daniel Fischer wrote:
Am Donnerstag, 3. Januar 2008 14:48 schrieb Henning Thielemann:
Sometimes I believed that I understand this reason, but then again I do
not understand. I see that left-associative (++) like in
((a0 ++ a1) ++ a2) ++ a3
would cause quadratic
I do not necessarily disagree
But if I can identify the overlapthen I have leant the overlap...on
the cheap.
-Original Message-
From: Bulat Ziganshin [mailto:[EMAIL PROTECTED]
Sent: 03 January 2008 14:39
To: Nicholls, Mark
Cc: Bulat Ziganshin; haskell-cafe@haskell.org
Subject:
Yitz wrote:
My impression from some previous posts is that
because of the high-level approach, it is difficult
to control the precise SQL that is generated. In practice,
you almost always have to do some tweaking that is
at least DB-dependent, and often application dependent.
Can't the same
On 3 Jan 2008, at 4:49 AM, Isaac Dupree wrote:
Achim Schneider wrote:
Achim Schneider [EMAIL PROTECTED] wrote:
[...]
I'm trying to grok that
[] = id
++ = .
in the context of Hughes lists.
they are also known as difference lists, and also used at type
String in the Prelude as ShowS, to
On 3 Jan 2008, at 7:40 AM, Nicholls, Mark wrote:
I do not necessarily disagree
But if I can identify the overlapthen I have leant the
overlap...on
the cheap.
Not really. You still don't have the context which allows you to fit
the Haskell features into a complete system.
On 3 Jan 2008, at 3:40 AM, Jens Blanck wrote:
The normal view taken by Haskellers is that the denotations of
Haskell types are CPPOs.
CPPO?
So:
(1) Must be monotone
(2) Must be continuous
Could you please define what you mean by those terms
in this context?
(Needn't be strict, even
On Thu, Jan 03, 2008 at 11:11:40AM +, Simon Marlow wrote:
David Roundy wrote:
Anyhow, could you retry this test with the above change in methodology, and
let me know if (a) the pull is still slow the first time and (b) if it's
much faster the second time (after the reverse unpull/pull)?
Henning Thielemann wrote:
I can't see it. If I consider (x++y) but I do not evaluate any element of
(x++y) or only the first element, then this will need constant time. If I
evaluate the first n elements I need n computation time units. How is (.)
on difference lists faster than (++) here?
apfelmus [EMAIL PROTECTED] wrote:
O((x ++ y) ++ z) ~ O(length x + length y) + O(length x)
+ O(x) + O(y) + O(z)
I would say that it's ~ O(length x) + O(length $ x ++ y) + O(2 * list
mangling)
--
(c) this sig last receiving data processing entity. Inspect headers for
Hello,
I'm confused about which HsColour version I should be using with
Haddock/Cabal (on Windows).
According to this page..
http://www.cs.york.ac.uk/fp/darcs/hscolour/
..the latest version is 1.9. But the latest version in Hackage is 1.6,
the latest version in the ftp downloads dir is 1.8,
Hi all,
Is any work being done on Haskell refactoring support, like HaRe or others?
Is anyone actively using refactoring? When using C#, I used Resharper a lot,
and ever since, I'm really hooked to refactoring, so I miss it a lot when
doing Haskelling. (I never seem to get a function name
Simon Marlow wrote:
...
I have seen strange artifacts like this before that turned out to be
caused by one of two things:
- bad cache interactions, e.g. we just happen to have laid out the code in
such a way that frequently accessed code sequences push each other out
of the cache, or
For small queries, it does not matter much which approach you choose.
But for large, complex queries, such 3-table join (especial Star
Transformation) and/or large data set (millions of rows involved in
large data warehouses), the performance will differ by order of
magnitude, depending on how
Hi Peter,
Is any work being done on Haskell refactoring support, like HaRe or others?
HaRe is still very active and is due for a new release very soon.
There are probably in excess of 40 refactorings for HaRe in total now, and
I intend to add more! Sadly, I am currently the only maintainer left
Don Stewart wrote:
(Hackage can't host code that uses GHC 6.8.2's language extension names
yet.)
{-# LANGUAGE XYZ #-} pragmas? If so, I'm pretty sure they're
supported, since xmonad uses them, and is on hackage.
Language pragmas in general are fine, but I believe I'm using a few that
are
Hi
PS: IMHO I don't think text should be the source format of our files… I
think we should use a standarized decorated AST as the source, from which we
can derive a textual (but also graphical) view and editor… Any comments on
that? J
Yes - I think you're wrong. I've seen non-textual editors
bos:
Don Stewart wrote:
(Hackage can't host code that uses GHC 6.8.2's language extension names
yet.)
{-# LANGUAGE XYZ #-} pragmas? If so, I'm pretty sure they're
supported, since xmonad uses them, and is on hackage.
Language pragmas in general are fine, but I believe I'm using a
bos:
This is an early release of Haskell bindings for the popular LLVM
compiler infrastructure project.
If you don't know what LLVM is, it's a wonderful toybox of compiler
components, from a complete toolchain supporting multiple architectures
through a set of well-defined APIs and IR
Hello Mark,
Thursday, January 3, 2008, 6:40:13 PM, you wrote:
it would be hard to understand overlap without knowing both systems.
you will believe that you understand it, but things will go strange
ways :)
I do not necessarily disagree
But if I can identify the overlapthen I have
HaRe works with both Emacs and VIM; you can also use it from a command
prompt meaning that it can be integrated into any tool that you require.
Indeed, there was even some investigation of porting it to Sub Etha Edit
with great success!
Cool! I'll check it out. However, I'm using some GHC
Cool! I'll check it out. However, I'm using some GHC extensions, so that
is
indeed a show stopper :)
Which extensions are you using that are not Haskell 98? I would be very
interested to know what users would generally require from a refactorer.
You mean a syntax-directed editor, right?
Hello Neil,
Thursday, January 3, 2008, 9:57:10 PM, you wrote:
Yes - I think you're wrong. I've seen non-textual editors for
programming languages, and they are severely unpleasant for all but
the most new beginners and restricted tasks.
what sort of code you are tried to develop? visual
Yes - I think you're wrong. I've seen non-textual editors for
programming languages, and they are severely unpleasant for all but
the most new beginners and restricted tasks.
For programmers and mathematicians, you are absolutely right. For beginners
and people who have highly developed visual
I agree with Neil, AST editors are generally ugly and hard to use. There
is also the problem of laying out Haskell code. Everyone uses their own
layout style and pretty printing ASTs is generally a bad thing to do in
this context.
I actually meant something more like
Hello Peter,
Thursday, January 3, 2008, 9:13:27 PM, you wrote:
well, i use refactoring without help of any tool. according to my
own experience, it's much easier in Haskell than in other languages i
know - basically, you just cut-n-paste your code around. i don't use
type signatures at all -
Hi Bulat,
i don't use
type signatures at all - this creates some problems when i wrote large
portion of code and try to make it compile, but nothing more
I believe type signatures are the very essence of Haskell documentation!
I'd much rather see a program with type signatures for functions
Hi,
I was installing various haskell packages from hackage.
When I was installing HaXml, I think it was complaining about
Text.PrettyPrint.HughesPJ not installed or something. (can't remember the
specific message and I can't reproduce now...)
So I installed pretty-1.0.0.0 package as well.
Ever
lemming:
On the one hand I like to use lists in my code because element types can
be freely chosen and maximum laziness allows feedback and other tricks. On
the other hand there are ByteString.Lazy and one could build chunky
sequences from other fast array implementations. They have
Currently, I'm trying to learn arrows and Yampa (mainly to see how well it
compares to my own dataflow/reactive stuff that was written in C#, C++ and
assembler)
Arrows won't work with HaRe at the moment, therefore Yampa won't either;
which is a shame.
First of all, let's see if I get the
Furthermore, IMHO, type signatures alone are not enough, a good parameter
name says at least as much as the type.
Yes! A very good point! :)
E.g. what does a function Int - Int - Bool do? I have no idea. A good
function name helps, e.g. isDivisible:: Int - Int - Bool. But then I still
I believe type signatures are the very essence of Haskell documentation!
I'd much rather see a program with type signatures for functions and
little (or no) comments over programs with no type signatures and
ambigious comments (if any comments at all!).
Okay, but when using a syntax directed
Peter Verswyvelen [EMAIL PROTECTED] writes:
Well, it's a good habit in Haskell to move the most important parameter to
the end of the argument list. See e.g.
http://www.haskell.org/haskellwiki/Parameter_order.
I must say I like these recommendations. As for the Data.Map examples,
the
Furthermore, when I need to perform refactoring, a rename is
just *one* change to the entire system, no matter how many other files
use
the name; no more merging for stupid renames.
I'm a little confused as to what you mean here. A renaming renames all
(and only those) uses of an identifier
I wrote:
... to control the precise SQL that is generated. In practice,
you almost always have to do some tweaking that is
at least DB-dependent, and often application dependent.
Peter Verswyvelen wrote:
Can't the same be said regarding SQL itself? It sometimes needs tweaking.
That's the
Lihn, Steve wrote:
For small queries, it does not matter much which approach you choose.
But for large, complex queries, such 3-table join (especial Star
Transformation) and/or large data set (millions of rows involved in
large data warehouses), the performance will differ by order of
On Jan 3, 2008 4:26 PM, Magnus Therning [EMAIL PROTECTED] wrote:
GHC 6.8 has just made it into Debian in a usable form. (w00t!)
Due to the library split my old cabal files don't work any longer.
updating them isn't the problem, the problem is keeping them compatible
with both versions of
1 - 100 of 117 matches
Mail list logo
