#1698: binary distribution not installable (problems with base package)
---+
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
Priority: normal
#1698: binary distribution not installable (problems with base package)
---+
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
Priority: normal
#1693: Make distclean (still) doesn't
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: high |Milestone: 6.8
Component: Compiler |
#1698: binary distribution not installable (problems with base package)
---+
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
Priority: normal
#1701: impossible happened
-+--
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
Priority: normal|
#1702: type operator precedences don't work in contexts
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug| Status: new
Priority: normal |
#1698: binary distribution not installable (problems with base package)
---+
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
Priority: normal
#1695: library submission: Data.Either.unzipEithers :: [Either a b] - ([a],[b])
---+
Reporter: JeremyShaw |Owner:
Type: proposal| Status: reopened
Priority: normal
#974: Add unzipEithers, lefts, rights to Data.Either
---+
Reporter: guest |Owner:
Type: proposal| Status: closed
Priority: normal |Milestone:
#1702: type operator precedences don't work in contexts
--+-
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug| Status: new
Priority: normal |
#1702: type operator precedences don't work in contexts
--+-
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug| Status: new
Priority: normal |
#1544: Derived Read instances for recursive datatypes with infix constructors
are
too inefficient
-+--
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
#1544: Derived Read instances for recursive datatypes with infix constructors
are
too inefficient
-+--
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
#1703: extra-gcc-opts not installed
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
#1698: binary distribution not installable (problems with base package)
---+
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: closed
Priority: normal
#1698: binary distribution not installable (problems with base package)
---+
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: reopened
Priority:
#1704: Exception when using the :list command in the GHCI debugger
-+--
Reporter: Olivier Boudry | Owner:
Type: bug | Status: new
Priority: normal |
#1704: Exception when using the :list command in the GHCI debugger
---+
Reporter: Olivier Boudry |Owner:
Type: bug | Status: new
Priority: normal |
#1695: library submission: Data.Either.unzipEithers :: [Either a b] - ([a],[b])
---+
Reporter: JeremyShaw |Owner:
Type: proposal| Status: reopened
Priority: normal
#1705: test
-+--
Reporter: guest |Owner:
Type: bug | Status: closed
Priority: normal|Milestone:
Component: Compiler | Version: 6.6.1
#1705: test
---+
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal| Milestone:
Component: Compiler |Version: 6.6.1
Hello.
I'm working on the translation of GHC's STG language to
JavaScript. I've started my implementation, but I've got stuck with
the STG case statements. The problem is the binder in case expression.
StgCase expr livevars liverhsvars bndr srt alttype alts
Operationally, I need to save
Hi
Are you aware that Dimitry is still working on ycr2js - and has made
great progress. There are details available in The Monad Reader, issue
7 (http://www.haskell.org/haskellwiki/The_Monad.Reader)
Thanks
Neil
On 9/17/07, Victor Nazarov [EMAIL PROTECTED] wrote:
Hello.
I'm working on the
David Schonberger wrote:
Another newbie question. To recap, running 6.6.1 on Vista. Fixed the
other problem--lexical error, apparently a BOM added by Notepad--by
getting Xemacs. Now when I type 'ghc -o hello hello.hs' at the prompt I
get /gcc: installation problem, cannot exec 'as': no such
[Redirecting to GHC Users which is the right place for questions about GHC.]
Yes, the garbage collector will (well, certainly should) find and kill such
threads. By kill I mean that they get sent an asynchronous exception of some
kind (I hope the documentation says which) so that the thread
case e of b { pati - rhsi }
* evaluates 'e',
* binds the resulting value to 'b',
* performs case analysis on the result to find which alternative to choose
* binds the variables of the pattern to the components of the value
This is described in the GHC commentary:
On Mon, 2007-09-17 at 13:03 +0100, Simon Marlow wrote:
skaller wrote:
1. Measure the size (and alignment, while at it) of all the
integer types. (trial execute and run).
We already do this. Incedentally, the GHC RTS does provide a full
complement of explicitly-sized types:
Hi
case e of b { pati - rhsi }
* evaluates 'e',
* binds the resulting value to 'b',
* performs case analysis on the result to find which alternative to choose
* binds the variables of the pattern to the components of the value
The Yhc.Core translator converts this to:
let b = e in case b
On Mon, 17 Sep 2007, Neil Mitchell wrote:
Hi
case e of b { pati - rhsi }
* evaluates 'e',
* binds the resulting value to 'b',
* performs case analysis on the result to find which alternative to choose
* binds the variables of the pattern to the components of the value
The
[ We apologize for multiple copies ]
***
1st Call for Papers
3rd International Workshop on Automated
Specification and Verification
of Web Systems (WWV'07)
San
On Sun, Sep 16, 2007 at 01:59:02PM -0700, Stefan O'Rear wrote:
{-# OPTIONS_GHC -XTypeFamilies -XEmptyDataDecls -XTypeSynonymInstances #-}
{-# LANGUAGE TypeFamilies, EmptyDataDecls, TypeSynonymInstances #-}
(Ian/Simon: I've seen this several times now. Maybe there should be a
warning
Ashley Yakeley wrote:
If I have a thread that's blocked on an STM retry or TChan read, and
none of its TVars are referenced elsewhere, will it get stopped and
garbage-collected?
I have in mind a pump thread that eternally reads off a TChan and pushes
the result to some function. If the TChan
If so, try working around the monomorphism restriction by changing
from a pattern binding to a function binding.
fold f = foldRegsUsed f
Brilliant. I hadn't known about the monomorphism restriction.
Now I know it's a 'necessary evil'. Thanks!
Norman
Hi Bas
Thank you for the answer.
I tried to fill in some blanks in the example you gave. And mostly got
a lot of context reduction stack overflows :(
Here is my example (a little closer to what I actually need):
data Foo a b = Foo { first :: a, second :: b }
class Bar (x :: * - *) where
On 9/17/07, Mads Lindstrøm [EMAIL PROTECTED] wrote:
Hi Bas
Thank you for the answer.
I tried to fill in some blanks in the example you gave. And mostly got
a lot of context reduction stack overflows :(
Here is my example (a little closer to what I actually need):
data Foo a b = Foo {
Hi,
I'm pleased to announce the first release of ListLike, a generic
interface to the various list-like structures in Haskell.
This grew out of the annoyance at having to handle Strings and
ByteStrings differently in my code, and has expanded on well past there.
ListLike implements an API very
On 2007-09-17, Dan Weston [EMAIL PROTECTED] wrote:
I noticed that there is no Data.Foldable context to your FoldableLL
class. How does your ListLike API work with/compare to/derive from the
At one point, I had declared that every instance of Data.Foldable to be
an instance of FoldableLL.
On 9/17/07, John Goerzen [EMAIL PROTECTED] wrote:
That does show one annoying property of typeclasses: instances too
easily appear and are impossible to replace.
The problem would be solved if it was possible to explicitly import
and export instance declarations.
I asked this before [1] but I
I noticed that there is no Data.Foldable context to your FoldableLL
class. How does your ListLike API work with/compare to/derive from the
classes in Data.Traversable?
http://darcs.haskell.org/ghc-6.6/packages/base/Data/Traversable.hs
Dan Weston
John Goerzen wrote:
Hi,
I'm pleased to
Hello,
I have put up a new version of monadLib, which is available from hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/monadLib-3.3.0
The changes in this version are fairly small:
* added an identity transformer, which is useful as a placeholder in
some applications,
*
On Monday 17 September 2007 6:14:57 pm Bas van Dijk wrote:
On 9/17/07, John Goerzen [EMAIL PROTECTED] wrote:
That does show one annoying property of typeclasses: instances too
easily appear and are impossible to replace.
The problem would be solved if it was possible to explicitly import
On Sun, 2007-09-16 at 12:13 -0700, David Roundy wrote:
On Sat, Sep 15, 2007 at 08:27:02AM +0100, Adrian Hey wrote:
Perhaps what you really mean is, you long for a Data.Map.Strict that
carries the offically blessed status of being shipped with ghc (reminds
me of someone asking for a ghc
David Roundy wrote:
On Sat, Sep 15, 2007 at 08:27:02AM +0100, Adrian Hey wrote:
Perhaps what you really mean is, you long for a Data.Map.Strict that
carries the offically blessed status of being shipped with ghc (reminds
me of someone asking for a ghc approved SDL binding a while back :-).
Hi
Would you care to explain why you have this aversion to libs that aren't
bundled with ghc?
They are less stable and have less quality control. It is also an
additional burden for a user to install the library to get the program
working.
cabal-install should fix the second. Some useful
Ketil Malde wrote:
It seems Adrian's library is a replacement for Data.Map, only with
higher performance and more features.
Well not quite for anyone using indexing or who needs O(1) size, but
apart from that it should be a fully compatible replacement. At least
that was my intention, though I
On 9/16/07, Ryan Ingram [EMAIL PROTECTED] wrote:
Is there a way to make GHCi not print the result
of an action but still make my variables get bound?
This seems to be a common question (I myself asked it recently), so
I've added an entry to the GHCi page on the
Maybe this is a stupid question, but I don't find something similar in
Haskell.
I find mod and rem, which work on integers. But I'm looking for a
function similar to C's fmod.
Of course I can write it myself, but I guess it must already exist under
a different name?
Thanks,
Peter
Hi all:
How to build a GHC which can run in a embed linux system ?
I have toolchain for the targer system. Using which, I can
compile on PC and run the program on the embed system.
Is this means, if I change CC env-var to the toolchain compiler
and compile GHC manually, I can get a program for
On 9/17/07, Martin Lütke [EMAIL PROTECTED] wrote:
What is the url for the wiki entry?
There was already a page at
http://haskell.org/haskellwiki/GHC/GHCi
so I put it there, but I also took the liberty of creating some #REDIRECTs, so
http://haskell.org/haskellwiki/ghci
should work just
Peter Verswyvelen wrote:
Maybe this is a stupid question, but I don't find something similar in
Haskell.
I find mod and rem, which work on integers. But I'm looking for a
function similar to C's fmod.
Of course I can write it myself, but I guess it must already exist under
a different
Odd place it is, indeed!
QUOTE: Data.Fixed... DESCRIPTION... This module defines a Fixed
file:///D:/app/ghc-6.6.1/doc/html/libraries/base/Fixed.html type for
fixed-precision arithmetic...*This module also contains generalisations
of div, mod, and divmod to work with any Real instance.*
On Mon, Sep 17, 2007 at 10:05:36AM +0100, Neil Mitchell wrote:
Would you care to explain why you have this aversion to libs that aren't
bundled with ghc?
They are less stable and have less quality control. It is also an
additional burden for a user to install the library to get the program
On Mon, Sep 17, 2007 at 11:07:10AM +0100, Adrian Hey wrote:
Ketil Malde wrote:
What would the disadvantages be to replacing Data.Map with this
implementation?
Personally I don't really like the idea of Data.Map, Data.Map.AVL or
any other lib becoming entrenched as official or de-facto
On Mon, Sep 17, 2007 at 07:54:02AM -0700, David Roundy wrote:
cabal-install may help, but what I'd really want is packaging in debian.
That's my (biased, because I used debian) standard of a maintained, useful
library. It's obviously a biased standard, but it isn't too hard for a
package to
On Mon, Sep 17, 2007 at 07:32:53PM +0800, L.Guo wrote:
I have toolchain for the targer system. Using which, I can
compile on PC and run the program on the embed system.
This isn't something that anyone's ever done with GHC, to the best of my
knowledge. You'd probably have to get your hands
On 9/16/07, Barney Hilken [EMAIL PROTECTED] wrote:
Now that I have a version of ghc with type classes, I have had a go
at implementing records based on the ideas I mentioned on this list a
few months ago. The code of my first attempt is available at http://
Neil Mitchell wrote:
Would you care to explain why you have this aversion to libs that aren't
bundled with ghc?
They are less stable and have less quality control.
Surely you jest? I see no evidence of this, rather the contrary in fact.
Though I must admit the documentation situation for
On Mon, Sep 17, 2007 at 04:50:13PM +0100, Ian Lynagh wrote:
On Mon, Sep 17, 2007 at 07:54:02AM -0700, David Roundy wrote:
cabal-install may help, but what I'd really want is packaging in debian.
That's my (biased, because I used debian) standard of a maintained, useful
library. It's
David Roundy wrote:
On Mon, Sep 17, 2007 at 11:07:10AM +0100, Adrian Hey wrote:
Ketil Malde wrote:
What would the disadvantages be to replacing Data.Map with this
implementation?
Personally I don't really like the idea of Data.Map, Data.Map.AVL or
any other lib becoming entrenched as official
On Mon, 17 Sep 2007, Adrian Hey wrote:
Ideally the way to deal with this is via standardised interfaces (using
type classes with Haskell), not standardised implementations. Even this
level of standardisation is not a trivial clear cut design exercise.
e.g we currently have at least two
Neil Mitchell wrote:
Hi
They are less stable and have less quality control.
Surely you jest? I see no evidence of this, rather the contrary in fact.
No, dead serious. The libraries have a library submission process.
It does not follow that libraries that have not been submitted
to this
On Sat, 15 Sep 2007, Sam Hughes wrote:
That's weird.
Prelude (x,y) - return $ (repeat 1, repeat 2)
You didn't tell, which Monad this shall be.
Prelude Just x - return $ Just (repeat 1)
[1,1,1,...
Prelude (x,_) - return $ (repeat 1, repeat 2)
[1,1,1,...
Prelude Just (x,y) - return $ Just
Andrew Coppin writes:
Adrian Hey wrote:
Personally I don't really like the idea of Data.Map, Data.Map.AVL or
any other lib becoming entrenched as official or de-facto standards.
It seems like a recipe for stagnation to me. IMHO such libs just
shouldn't be bundled with ghc (or any other
David Roundy [EMAIL PROTECTED] writes:
Data.Map is a standardized interface, *not* a standardized implementation.
I'm not saying it's a *good* standardized interface, but it's the only one
we've got.
Not so! There is another more venerable interface, namely Data.FiniteMap.
That interface was
On Mon, Sep 17, 2007 at 06:43:40PM +0100, Adrian Hey wrote:
so that other packages can use them in their interfaces without putting
undue burden on their users (and without the users being forced to
figure out how to convert back and forth between various different
Data.Map.*).
I would
On 9/16/07, Mads Lindstrøm [EMAIL PROTECTED] wrote:
Hi all
If I have this type:
data Foo a b = ...
and this class
class Bar (x :: * - *) where ...
I can imagine two ways to make Foo an instance of Bar. Either I must
apply the 'a' or the 'b' in (Foo a b). Otherwise it will not have
On 9/17/07, Henning Thielemann [EMAIL PROTECTED] wrote:
On Sat, 15 Sep 2007, Sam Hughes wrote:
Prelude (x,y) - return $ (repeat 1, repeat 2)
You didn't tell, which Monad this shall be.
GHCi always runs in the IO monad.
-- ryan
___
Haskell-Cafe
On Sat, 15 Sep 2007, Joachim Breitner wrote:
today while mowing the lawn, I thought how to statically prevent some
problems with infinte lists. I was wondering if it is possible to
somehow mark a list as one of finite/infinite/unknown and to mark
list-processing functions as whether they can
Hi folks,
I just announced ListLike[1] on [EMAIL PROTECTED] Rather than repeat
that announcement here, I'd like to make a few observations that came
out of the development of this program:
* I wrote extensive QuickCheck cases for this and wrapped them in HUnit
for better display and future
Philippa Cowderoy wrote:
On Mon, 17 Sep 2007, Adrian Hey wrote:
Ideally the way to deal with this is via standardised interfaces (using
type classes with Haskell), not standardised implementations. Even this
level of standardisation is not a trivial clear cut design exercise.
e.g we
Adrian Hey wrote:
Personally I don't really like the idea of Data.Map, Data.Map.AVL or
any other lib becoming entrenched as official or de-facto standards.
It seems like a recipe for stagnation to me. IMHO such libs just
shouldn't be bundled with ghc (or any other compiler) for this reason.
Hi
What's bad about stagnation is that nobody will bother to produce
anything better (at least not as a fully polished publicly available
open source project), precisely because they have little chance of
achieving a user base exceeding 1 (at least not if the attitude of
David and Neil is
Philippa Cowderoy wrote:
On Mon, 17 Sep 2007, Adrian Hey wrote:
Ideally the way to deal with this is via standardised interfaces (using
type classes with Haskell), not standardised implementations. Even this
level of standardisation is not a trivial clear cut design exercise.
e.g we currently
Roberto Zunino wrote:
apfelmus wrote:
cons:: a - List e f a - List Nonempty f a
But unfortunately, finiteness is a special property that the type
system cannot guarantee. The above type signature for cons doesn't
work since the following would type check
bad :: a - List Nonempty
[EMAIL PROTECTED] wrote:
Andrew Coppin writes:
Out of curiosity... what's so bad about stagnation? (Otherwise
known as having a fixed structure that everybody can rely on...)
Oh come on, you know the answer, do you like provocations?
Shall I remind how many people are unhappy e.g., with the
Hi
They are less stable and have less quality control.
Surely you jest? I see no evidence of this, rather the contrary in fact.
No, dead serious. The libraries have a library submission process.
Compare me changing my tagsoup library, to me changing my filepath
library which comes bundled
On Mon, Sep 17, 2007 at 07:38:00PM +0100, Malcolm Wallace wrote:
David Roundy [EMAIL PROTECTED] writes:
Data.Map is a standardized interface, *not* a standardized implementation.
I'm not saying it's a *good* standardized interface, but it's the only one
we've got.
Not so! There is
Andrew Coppin wrote:
If something is broken, it should be fixed. If something isn't broken, I
see no reason to change it. You might call that stagnation, but I view
it as something else...
Nobody is talking about changing anything, at least not Data.Map.
We're talking about why alternatives
Andrew Coppin wrote:
Adrian Hey wrote:
Personally I don't really like the idea of Data.Map, Data.Map.AVL or
any other lib becoming entrenched as official or de-facto standards.
It seems like a recipe for stagnation to me. IMHO such libs just
shouldn't be bundled with ghc (or any other compiler)
On 9/17/07, Roberto Zunino [EMAIL PROTECTED] wrote:
I thought this was possible with GADTs (is it?):
data Z
data S n
data List a len where
Nil :: List a Z
Cons:: a - List a len - List a (S len)
Slightly related:
The other day I was playing with exactly this GADT. See:
{-# LANGUAGE TypeFamilies #-}
Hi Justin, thanks for your interest. Hope this helps!
module Examples where
import Records
To get started, you need to define your labels. They are just
singleton datatypes:
data FirstName = FirstName deriving (Show, Eq, Ord)
data Surname =
Competing packages for XML or DBM is really awful, unless they happen
to be interface compatible.
And there is a good way of switching imps at assembly time, such that
lib code that consumes xml doesn't depend on which xml imp I have.
Of course, I realize that a good interface for those is still
who knows how to compile yi-gtk?
i tried,but it told me mine miss gtk.
2007-09-18
clisper
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Paul Johnson-2 wrote:
SevenThunders wrote:
Unfortunately if I wrap my matrix references in the IO monad, then at
best
computations like
S = A + B are themselves IO computations and thus whenever they are
'invoked' the computation ends up getting performed repeatedly contrary
to
my
Couple of thoughts/observations:
- Erlang has a vm, so that would avoid building a vm.
On the downside, erlang is not pure: the message-passing and the io:
commands imply the possibility of side-effects.
Still, it could be good enough for a proof-of-concept?
- implementation as a library
Just out of curiosity, how could one do something like a factory, so
that by default a library uses, say, Data.Map, but by making a simple
assignment we can switch the library to use a different
implementation?
(This is alluded to above, but not explicitly stated. I guess it's
too easy, but
On 9/18/07, Hugh Perkins [EMAIL PROTECTED] wrote:
Just out of curiosity, how could one do something like a factory, so
that by default a library uses, say, Data.Map, but by making a simple
assignment we can switch the library to use a different
implementation?
(And of course, the 10 million
On 9/17/07, Hugh Perkins [EMAIL PROTECTED] wrote:
Just out of curiosity, how could one do something like a factory, so
that by default a library uses, say, Data.Map, but by making a simple
assignment we can switch the library to use a different
implementation?
(This is alluded to above, but
88 matches
Mail list logo
