#2949: ghci suddenly won't start
-+--
Reporter: guest |Owner:
Type: bug | Status: new
Priority: normal|Milestone:
#2063: x86_64: RTS linker depends on working MAP_32BIT
---+
Reporter: dons|Owner: igloo
Type: task| Status: new
Priority: normal |
#2951: Add support for amd64-solaris2 platform
+---
Reporter: kgardas |Owner: simonmar
Type: feature request | Status: new
Priority: normal |Milestone:
#2063: x86_64: RTS linker depends on working MAP_32BIT
---+
Reporter: dons|Owner: igloo
Type: task| Status: new
Priority: normal |
#2955: Data in $HOME/.ghc is not validated leading to obscure error messages
when
using ghc
---+
Reporter: erikd | Owner:
Type: bug | Status: new
Priority: normal
#2956: Template Haskell: cannot splice sections
-+--
Reporter: Deewiant | Owner:
Type: bug | Status: new
Priority: normal|
#2955: Data in $HOME/.ghc is not validated leading to obscure error messages
when
using ghc
--+-
Reporter: erikd | Owner:
Type: bug | Status: closed
Priority:
#2952: ghci fails to start from start menu on windows 7
-+--
Reporter: larsv| Owner:
Type: bug | Status: new
Priority: normal | Milestone:
Component: GHCi |
#2951: Add support for amd64-solaris2 platform
+---
Reporter: kgardas |Owner: simonmar
Type: feature request | Status: new
Priority: normal |Milestone:
#1548: printf bugs
-+--
Reporter: l@web.de |Owner:
Type: bug | Status: new
Priority: normal|Milestone: 6.10 branch
#2131: concprog001(threaded2) occasional failures.
-+--
Reporter: simonmar |Owner: simonmar
Type: bug | Status: closed
Priority: normal|
#2957: GHC head build fails on non-GNU system assuming `patch' command is GNU
patch
+---
Reporter: kgardas | Owner:
Type: bug | Status: new
Priority: normal |
#2958: ghc-pkg describe is lying
---+
Reporter: josef | Owner:
Type: bug | Status: new
Priority: normal | Component: Build System
Version: 6.10.1 |
#2951: Add support for amd64-solaris2 platform
+---
Reporter: kgardas |Owner: simonmar
Type: feature request | Status: new
Priority: normal |Milestone:
#2959: Merge in LambdaVM (Haskell to Java/JVM bytecode translator)
-+--
Reporter: kgardas | Owner:
Type: feature request | Status: new
Priority: normal
#2810: Debugger: change context to the module containing the current breakpoint
-+--
Reporter: simonmar |Owner:
Type: feature request | Status: new
#2960: Add instance Data.Traversable for Data.IntMap
-+--
Reporter: Deewiant | Owner:
Type: proposal | Status: new
Priority: normal|
#2808: createDirectoryIfMissing should be atomic
+---
Reporter: EricKow |Owner:
Type: bug | Status: new
Priority: normal
#2721: Newtype deriving doesn't work with type families
---+
Reporter: rl |Owner:
Type: feature request | Status: new
#1377: GHCi debugger tasks
-+--
Reporter: simonmar |Owner:
Type: task | Status: new
Priority: normal|Milestone: 6.10
#2368: ASSERT failed! file coreSyn/CorePrep.lhs line 669
--+-
Reporter: batterseapower |Owner: igloo
Type: bug| Status: closed
Priority:
#2063: x86_64: RTS linker depends on working MAP_32BIT
---+
Reporter: dons|Owner:
Type: task| Status: new
Priority: normal |
#2961: Incorrect FFI code generated with -O
-+--
Reporter: sjanssen | Owner:
Type: bug | Status: new
Priority: normal| Component: Compiler (FFI)
Version:
#2063: x86_64: RTS linker depends on working MAP_32BIT
---+
Reporter: dons|Owner:
Type: task| Status: new
Priority: normal |
#2643: Optimized IntMap / IntSet construction from sorted input
--+-
Reporter: sedillard |Owner: igloo
Type: proposal | Status: closed
Priority: normal
#2644: type of IntMap.intersection[WithKey] is incorrect
--+-
Reporter: sedillard |Owner: igloo
Type: bug| Status: closed
Priority: normal
#2645: fix type, performance of IntMap(Set).findMin(Max)
--+-
Reporter: sedillard |Owner: igloo
Type: proposal | Status: closed
Priority: normal
#2445: better error message needed for missing package files
-+--
Reporter: duncan|Owner: igloo
Type: merge | Status: closed
Priority: high
#2931: Template Haskell: Quoting single letter identifier leads to a parse error
at end of input.
--+-
Reporter: int-e |Owner: igloo
Type: merge | Status:
| I hardly use any let expressions (shame on me??) and I am not very familiar
| with them. But I figured out you might have mistaken, so I changed the bit
| to:
|antecedent :: Rule - Expression
|antecedent r = case r of
|Ru{} - if (rrsrt r == AlwaysExpr) then error
Peter Hercek wrote:
Is it possible to load one more module to ghci without unloading the
modules I have already loaded? The module I would like to load in
addtion is not installed and I do not want it installed. It is also
independent of any other modules. There is no dependency from the
Simon Marlow wrote:
Peter Hercek wrote:
Is it possible to load one more module to ghci without unloading the
modules I have already loaded? The module I would like to load in
addtion is not installed and I do not want it installed. It is also
independent of any other modules. There is no
Hi,
I tried Simon's :
Gc{} - case r of { GC{ grspe = x } - Tm x }
This still failed with Loop, like alternative 1.
Then I tried Claus Reinke's suggestion:
Gc{} - Tm $! (grspe r)
which had the same result , the loop.
However, I was very fortunate to have Bas Joosten look
OK once I bit the bullet and looked at the code the bug was obvious.
When you pattern match
Ru{rrsrt = AlwaysExpr} - error blah
GHC uses, well, pattern-matching to see if rrsrt is AlwaysExpr.
But when you say
Ru{} - if (rrsrt r == AlwaysExpr) then error blah else ...
then GHC
Hello Simon,
Friday, January 16, 2009, 7:07:09 PM, you wrote:
Sadly you have not defined it. You just say
instance Eq RuleType
this is very common error. it would be great to find some way to deal
with it (for predefined classes at very least...)
--
Best regards,
Bulat
On Fri, Jan 16, 2009 at 11:07 AM, Simon Peyton-Jones
simo...@microsoft.com wrote:
So, clearly not a bug in GHC; but it would be more felicitous if it gave you
a warning about the instance declaration for Eq RuleType. The difficulty is
that it's not clear when to warn; it's ok to use default
Rodney Price wrote:
So where do I as a practicing programmer and researcher go to learn all
this stuff? My background is theoretical physics (PhD, 1993) so I'm no
stranger to math. I've been using Haskell off and on since Haskell 1.4,
and while I see lots of theoretical discussions on this
GTTSE 2009, 06-11 July, 2009, Braga, Portugal
3rd International Summer School on
Generative and Transformational Techniques in Software Engineering
http://gttse.wikidot.com/
SCOPE AND FORMAT
The biannual, week-long GTTSE summer school brings together PhD
students,
On Jan 16, 2009, at 2:00 AM, Apfelmus, Heinrich wrote:
Rodney Price wrote:
So where do I as a practicing programmer and researcher go to learn
all
this stuff?
...
In the long term, the aim of the Haskell Wikibook is to become a
gentle
introduction to this stuff. It's nowhere near
On Fri, Jan 16, 2009 at 7:46 AM, Dave Bayer ba...@cpw.math.columbia.edu wrote:
As a mathematician, Haskell has renewed my interest in category theory. I
had thought one learns category theory most easily at age 20, because it
paints such an eviscerated view of flesh-and-blood subjects like
Dear all,
I'm pleased to announce the upload of the leapseconds-announced
package[1] to Hackage. leapseconds-announced contains a single module
and a single function implementing the
Data.Time.Clock.TAI.LeapSecondTable interface (type).
The documentation[2] for
add2 :: JSON a = MyData - String - a - MyData
add2 m k v = fromJust $ (\js - m { json = js }) `liftM` (showJSON
`liftM` (toJSObject `liftM` (((k, showJSON v):) `liftM` (fromJSObject
`liftM` (jsObj $ json m)
setJSON m js = m {json = js}
add2 m k v = fromJust $ setJSON m $ showJSON $
On 16 Jan 2009, at 02:30, eyal.lo...@gmail.com wrote:
Very nice series of refactorings!
I'd like to add that it might be a better argument order to replace:
JSON a = MyData - String - a - MyData
with:
JSON a = String - a - MyData - MyData
Just so you can get a (MyData - MyData)
On Thu, Jan 15, 2009 at 07:46:02PM +, Andrew Coppin wrote:
If we *must* insist on using the most obscure possible name for
everything,
I don't think anybody even suggests using obscure names. Some people
insist on precise names.
The problem is that many Haskell constructs are so
Mauricio wrote:
After you pointed my dumb mistake, I was able to build
the first example -- without any of the extensions! Haskell
can be misterious some times.
Strange enough, I can't get the original (and, to my eyes,
equal) problem to work.
Indeed Haskell can be misterious sometimes. Now
On Thu, Jan 15, 2009 at 11:54 PM, ChrisK hask...@list.mightyreason.com wrote:
So the original article, which coined 'Appendable', did so without much
thought in the middle of a long post. But it does show the thinking was
about collections and there is one ONE instance of Monoid at
Haskellians,
i've found a way to generalize the LogicT transformer and calculated it's
application to three fairly interesting examples. The approach -- with some
sample codes as scala+lift web apps -- is described
Dan Weston wrote:
Richard Feinman once said: if someone says he understands quantum
mechanics, he doesn't understand quantum mechanics.
But what did he know...
Well, I am a physicist and Feynman (with a y, not an i), is not talking about
the linear algebra.
Of course, linear algebra [1]
On Thu, 15 Jan 2009, Sigbjorn Finne wrote:
I guess it's time to publish more widely the availability of a
modernization of the venerable and trusted HTTP package, which I've been
working on offon for a while.
I was always afraid that a fork may happen during I work on HTTP in order
to get
2009/1/16 Derek Elkins derek.a.elk...@gmail.com:
I think the name issue is a red herring. The real issue is that, after
being confronted by a concept with an unfamiliar name, it can be very
difficult to figure out the nature of the concept. That is, it's not the
name itself that's the problem,
Here is a great Monoid found in the wild story:
I just implemented a library for binary message serialization that follows
Google's protocol buffer format.
The documentation of this was very scattered in some respects but I kept reading
snippets which I have pasted below. The effect of
Hi Luke,
On Fri, Jan 16, 2009 at 2:31 AM, Luke Palmer lrpal...@gmail.com wrote:
However, I think it is flawed, since the following
case c of
Polar _ _ - it's polar!
Rect _ _ - it's rect!
seems like valid code but does not make any sense.
I think it's okay, given that we
Dan Piponi wrote:
Several people have suggested this, and I think it would go a long way
towards solving the problem.
That sounds like a good plan. Which precise bit of documentation
should I update? Make a new wiki page? Put it in here:
2009/1/15 Derek Elkins derek.a.elk...@gmail.com:
On Thu, 2009-01-15 at 18:27 +, Lennart Augustsson wrote:
On Thu, Jan 15, 2009 at 6:04 PM, Paul Moore p.f.mo...@gmail.com wrote:
Mathematical precision isn't appropriate in all disciplines.
That's very true. But programming is one where
2) the Haskell docs _don't_ do good enough a job at giving intuition
for what math terms mean
If we fix #2, then #1 is no longer a problem, yes?
For you folks who work on GHC, is it acceptable to open tickets for
poor documentation of modules in base? I think leaving the
documentation to the
That looks like a freakin' cool idea; however very hard to implement;
so why not write such wikis in predefined places, like,
haskell.org/haskellwiki/Data/Monoid/ and allow haddock to
automatically put links there from the generated documentation? This
would make the documentation (on the wiki)
On Fri, Jan 16, 2009 at 3:46 AM, Eugene Kirpichov ekirpic...@gmail.comwrote:
That looks like a freakin' cool idea; however very hard to implement;
so why not write such wikis in predefined places, like,
haskell.org/haskellwiki/Data/Monoid/ and allow haddock to
automatically put links there
It's a criticism already voiced by the great David Bowie:
My Brain Hurt like a warehouse, it had no room to spare
I had to cram so many things to store everything in there
Immanuel
On Thu, Jan 15, 2009 at 4:34 PM, John Goerzen jgoer...@complete.org wrote:
Hi folks,
Don Stewart noticed
Thorkil Naur wrote:
Peter Verswyvelen wrote:
It is rather funny. When we are young kids, we learn weird symbols like
A B C a b c 1 2 3
which we accept after a while.
But Functor, Monoid or Monad, that we cannot accept anymore. Why, because
these are not intuitive? Are the symbols
Artyom Shalkhakov ha scritto:
[...]
Prelude :l foo.hs
[1 of 1] Compiling Main ( foo.hs, interpreted )
Ok, modules loaded: Main.
*Main isDirectory /var
interactive:1:0:
Ambiguous occurrence `isDirectory'
It could refer to either `Main.isDirectory', defined at foo.hs:6:0
I have to say, I agree with Lennart here. Terms like monoid have had
a precise definition for a very long time. Replacing an ill-defined
term by a vaguely defined term only serves to avoid facing ones
ignorance - IMHO an unwise move for a technical expert. Learning
Haskell has often
On Thu, 2009-01-15 at 18:41 -0500, Cale Gibbard wrote:
2009/1/15 Andrew Coppin andrewcop...@btinternet.com:
OK, well then my next question would be in what say is defining
configuration files as a monoid superior to, uh, not defining them as a
monoid? What does it allow you to do that you
On Fri, Jan 16, 2009 at 5:39 AM, Creighton Hogg wch...@gmail.com wrote:
For you folks who work on GHC, is it acceptable to open tickets for
poor documentation of modules in base? I think leaving the
documentation to the tragedy of the commons isn't the best move, but
if even a few of us could
On Thu, 15 Jan 2009, Lennart Augustsson wrote:
If I see Monoid I know what it is, if I didn't know I could just look
on Wikipedia.
And if you're a typical programmer who is now learning Haskell, this will
likely make you want to run screaming and definitely be hard to
understand. We at least
2009/1/16 Apfelmus, Heinrich apfel...@quantentunnel.de:
How to learn? The options are, in order of decreasing effectiveness
university course teacher in person
book irc
mailing list
online tutorial
haskell wiki
haddock documentation
On Thu, 15 Jan 2009, Andrew Coppin wrote:
I don't know about you, but rather than knowing that joinFoo is associative,
I'd be *far* more interested in finding out what it actually _does_.
A good many descriptions won't tell you whether it's associative though,
and sometimes you need to know -
On Fri, Jan 16, 2009 at 1:23 PM, Philippa Cowderoy fli...@flippac.org wrote:
On Thu, 15 Jan 2009, Lennart Augustsson wrote:
If I see Monoid I know what it is, if I didn't know I could just look
on Wikipedia.
And if you're a typical programmer who is now learning Haskell, this will
likely
On Fri, 2009-01-16 at 14:16 +0100, david48 wrote:
Upon reading this thread, I asked myself : what's a monoid ? I had no
idea. I read some posts, then google haskell monoid.
The first link leads me to Data.Monoid which starts with
Description
The Monoid class with various
On Thu, 15 Jan 2009, Andrew Coppin wrote:
I was especially amused by the assertion that existential quantification is
a more precise term than type variable hiding. (The former doesn't even tell
you that the feature in question is related to the type system! Even the few
people in my poll who
Ketil Malde ketil at malde.org writes:
On Thu, Jan 15, 2009 at 07:46:02PM +, Andrew Coppin wrote:
If we *must* insist on using the most obscure possible name for
everything,
I don't think anybody even suggests using obscure names. Some people
insist on precise names.
On Thu, 15 Jan 2009, John Goerzen wrote:
Several people have suggested this, and I think it would go a long way
towards solving the problem. The problem is: this documentation can
really only be written by those that understand the concepts,
understand how they are used practically, and have
On Fri, 16 Jan 2009, Duncan Coutts wrote:
If you or anyone else has further concrete suggestions / improvements
then post them here now! :-)
Spell out what associativity means and what it means for that operation to
have an identity. List a few examples (stating that they're not all
Just as a reported speedup, downloading a 5MB file from my own local
machine (via http) went from 1.05 secs to 0.053 secs. Yes, it's
really an order of magnitude better. Performance now is on par or
slightly better than cURL (however to get more protocols than HTTP,
you'll still need the
Hi all!
I am happy to announce general availability of darcs 2.2.0.
Getting the release
---
For this release, we have decided to provide two flavours, depending on the
build system used:
1) The source tarball, http://www.darcs.net/darcs-2.2.0.tar.gz, which can be
built using
On Thu, 2009-01-15 at 22:36 -0800, Sigbjorn Finne wrote:
Another change/fix in this release is the _alleged_ fix to the
long-standing bug in the use of absolute URIs vs absolute paths in
requests (for non-proxied and proxied use.) Give it a go..
cabal-install with HTTP-3001.x:
$ cabal
Hi,
I would like to take some time to study Haskell properly, so
that I could help others and pay my debt for the many times
I had to bother with my syntax questions. And, of course,
make better use of the language.
My first attempt was to read the syntax description in
Haskell 98 report, and
Hello david48,
Friday, January 16, 2009, 4:16:51 PM, you wrote:
Upon reading this thread, I asked myself : what's a monoid ? I had no
idea. I read some posts, then google haskell monoid.
it would be interesting to google C++ class or Lisp function and
compare experience :)
--
Best regards,
About latest thread on better naming and documentation improvement, why
don't organize an interactive session where:
1) normal users tell what's wrong about a package/module documentation
2) the package/module author/maintainer fix the documentation in real
time, so that users can review it
Hello Mauricio,
Friday, January 16, 2009, 5:00:58 PM, you wrote:
So: if someone wants to learn the details of the language,
what could be the subset of extensions one should learn
and make regular use, and also include in code supposed
to be used by others in the long term?
probably
On Fri, 2009-01-16 at 15:12 +0100, Manlio Perillo wrote:
About latest thread on better naming and documentation improvement, why
don't organize an interactive session where:
1) normal users tell what's wrong about a package/module documentation
2) the package/module author/maintainer fix
Thanks Jeff,
regarding having to use both HTTP and cURL -- or perhaps only
the latter for code simplicitly -- that will probably remain the case for
quite a while still. To help with that situation, I put together an
over-arching
'webclient' library that abstracts over the transport layers
Hi,
I would like to suggest a change to Haskell prime's handling of
imports.
First, let me define a few terms:
Qualified import:
import qualified Data.Map [as Map]
Closed-unqualified import:
import Data.Map(Map, lookup)
Open-unqualified import:
import Data.Map
I believe that the last type,
On Fri, Jan 16, 2009 at 4:42 PM, eyal.lo...@gmail.com
eyal.lo...@gmail.comwrote:
Hi,
I would like to suggest a change to Haskell prime's handling of
imports.
First, let me define a few terms:
Qualified import:
import qualified Data.Map [as Map]
Closed-unqualified import:
import
On Fri, Jan 16, 2009 at 03:12:21PM +0100, Manlio Perillo wrote:
About latest thread on better naming and documentation improvement, why
don't organize an interactive session where:
1) normal users tell what's wrong about a package/module documentation
2) the package/module author/maintainer
On Fri, 16 Jan 2009, eyal.lo...@gmail.com wrote:
I believe that the last type, open-unqualified is a really bad idea,
and should be discouraged or even disallowed. It should definitely not
be the default, like it is today.
You are not alone:
On Fri, 16 Jan 2009, eyal.lo...@gmail.com wrote:
import qualified Control.Monad as M
M.for
M.map
and so on.
http://haskell.org/haskellwiki/Qualified_names
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hello Sigbjorn,
Friday, January 16, 2009, 5:42:06 PM, you wrote:
first question: are these packages (http, curl, curl-shell, webclient)
windows-compatible? second - that is advantages of using http (or
webclient) over curl?
sorry if questions are stupid - i'm pretty ignorant here :)
Thanks
On Fri, 16 Jan 2009, Sigbjorn Finne wrote:
gain access to www.haskell.org and update http://www.haskell.org/http,
so for now you may pick up a new version the lib via
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HTTP
GIT repo for HTTP-4000 / HTTPbis is here
On Fri, 2009-01-16 at 14:16 +0100, david48 wrote:
Part of the problem is that something like a monoid is so general that
I can't wrap my head around why going so far in the abstraction.
For example, the writer monad works with a monoid; using the writer
monad with strings makes sense because
Hello,
Personally, I would like to see the laws more explicitly listed. Some
like:
-- The Monoid Laws:
--
-- 1. Associative:
--
--x `mappend` (y `mappend` z) == (x `mappend` y) `mappend` z
--
-- 2. Left Identity:
--
-- mempty `mappend` y == y
--
-- 3. Right identity:
--
-- x `mappend`
I've been playing around with this, but haven't been able to come up with
anything.
myFunc f (a,b) (c,d) = (f a c, f b d)
It feels as if there should be a nice simple version of this using some
combination of {un,}curry, on, , ***, or something else.
Any thoughts?
2009/1/16 Peter Verswyvelen bugf...@gmail.com
[...]
After a while you decide that you need to change the Bla data type, maybe
give Dog more fields, maybe completely redesign it, maybe not exposing it,
but you want to keep existing code backwards compatible. With F# you can
write Active
On Fri, 16 Jan 2009, John Van Enk wrote:
2009/1/16 Peter Verswyvelen bugf...@gmail.com
[...]
After a while you decide that you need to change the Bla data type, maybe
give Dog more fields, maybe completely redesign it, maybe not exposing it,
but you want to keep existing code backwards
saml @pl myFunc f (a,b) (c,d) = (f a c, f b d)
lambdabot myFunc = (`ap` snd) . (. fst) . flip flip snd . ((flip . (ap .))
.) . flip flip fst . ((flip . ((.) .)) .) . (flip = (((.) . flip . (((.) .
(,)) .)) .))
why not use zipWith?
[a,b] `g` [c,d] where g = zipWith f
2009/1/16 Andrew Wagner
Sorry it won't work because list should be homogeneous.
I think your myFunc is standard.
This guy names it thread:
http://alaska-kamtchatka.blogspot.com/2009/01/essence-of-concatenative-languages.html
On Fri, Jan 16, 2009 at 10:32 AM, sam lee skyn...@gmail.com wrote:
saml @pl myFunc f (a,b)
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA512
On Fri, Jan 16, 2009 at 9:29 AM, Duncan Coutts wrote:
On Fri, 2009-01-16 at 15:12 +0100, Manlio Perillo wrote:
About latest thread on better naming and documentation improvement, why
don't organize an interactive session where:
1) normal users
Eyal Lotem wrote:
B) Code that has open unqualified imports may break when new symbols
are added to the libraries its importing. This means that libraries
cannot even be considered backwards compatible if they retain
semantics, but add new exported names.
This is not as
Duncan Coutts ha scritto:
On Fri, 2009-01-16 at 15:12 +0100, Manlio Perillo wrote:
About latest thread on better naming and documentation improvement, why
don't organize an interactive session where:
1) normal users tell what's wrong about a package/module documentation
2) the package/module
As far as I understand, record syntax and data accessor only give access to
the data, they don't provide alternate views / interpretations of the data,
something that Active Patterns or view patterns in Haskell do?
On Fri, Jan 16, 2009 at 4:27 PM, Henning Thielemann
lemm...@henning-thielemann.de
Peter,
I think that's correct. I would really love to be able to make alternate
constructors and views. I know we can make specialized constructors, but I
don't think there's a good way to pattern match on these. It would be pretty
sweet if we could.
/jve
On Fri, Jan 16, 2009 at 11:14 AM, Peter
1 - 100 of 144 matches
Mail list logo
