#2362: allow full import syntax in GHCi
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
Priority: high |
#2442: Heuristics to improve error messages for badly referenced things
-+--
Reporter: batterseapower|Owner: simonpj
Type: feature request | Status: new
Priority:
#2798: Enable rec keyword when RecursiveDo is enabled?
-+--
Reporter: nominolo |Owner:
Type: task | Status: new
Priority: high
#1876: Complete shared library support
-+--
Reporter: simonmar |Owner: duncan
Type: task | Status: new
Priority: high |
#1924: Rewrite the handling of values we get from ./configure
-+--
Reporter: igloo |Owner: igloo
Type: bug | Status: new
Priority: high
#2189: hSetBuffering stdin NoBuffering doesn't work on Windows
---+
Reporter: FalconNL|Owner:
Type: bug | Status: new
Priority:
#2451: New signal-handling API
-+--
Reporter: simonmar |Owner: simonmar
Type: proposal | Status: new
Priority: high |Milestone: 6.12.1
#2578: ld: atom sorting error for ... on OS X
-+--
Reporter: igloo |Owner: igloo
Type: bug | Status: new
Priority: high |Milestone: 6.12.1
#2793: CLDouble is nothing like a long double
-+--
Reporter: jedbrown |Owner: igloo
Type: bug | Status: new
Priority: high |
#2925: Linker mmap failure on FreeBSD/x86_64
---+
Reporter: simonmar|Owner: simonmar
Type: bug | Status: new
Priority: high|Milestone: 6.12.1
#2978: Add support for more characters to UnicodeSyntax
-+--
Reporter: porges|Owner: simonmar
Type: feature request | Status: new
Priority: high
#1346: bootstrap from HC files
-+--
Reporter: simonmar |Owner: igloo
Type: bug | Status: new
Priority: high |Milestone: 6.12.1
#3132: x86 code generator generates bad FPU register names
---+
Reporter: int-e |Owner: benl
Type: bug | Status: new
Priority: high|
#1346: bootstrap from HC files
-+--
Reporter: simonmar |Owner: igloo
Type: bug | Status: closed
Priority: high |Milestone: 6.12.1
#2798: Enable rec keyword when RecursiveDo is enabled?
-+--
Reporter: nominolo |Owner:
Type: task | Status: new
Priority: high
#3253: validate failure (GCC warning)
--+-
Reporter: isaacdupree|Owner: simonmar
Type: bug| Status: reopened
Priority: high |Milestone: 6.12.1
#3265: Type operators can be defined without the TypeOperators extension flag
-+--
Reporter: nibro |Owner: simonpj
Type: bug | Status: new
#3138: Returning a known constructor: GHC generates terrible code for cmonad
-+--
Reporter: simonpj |Owner:
Type: run-time performance bug | Status: new
#3138: Returning a known constructor: GHC generates terrible code for cmonad
-+--
Reporter: simonpj |Owner:
Type: run-time performance bug | Status: new
#3256: Extra EOT from NoBuffering mode in emacs
-+--
Reporter: judah |Owner:
Type: bug | Status: closed
Priority: normal|Milestone: 6.10.4
#2793: CLDouble is nothing like a long double
-+--
Reporter: jedbrown |Owner: igloo
Type: bug | Status: new
Priority: high |
#3247: GHCI segfaults when per-thread stack size is larger than max stack size
---+
Reporter: earthy |Owner: simonmar
Type: bug | Status: new
Priority: normal
#3247: GHCI segfaults when per-thread stack size is larger than max stack size
---+
Reporter: earthy |Owner: simonmar
Type: bug | Status: closed
Priority: normal
#3268: implement the Cabal ${pkgroot} spec extension
-+--
Reporter: duncan| Owner:
Type: feature request | Status: new
Priority: normal|
#3269: Stop using PackedString in template-haskell; drop packedstring as a
bootlib
---+
Reporter: simonmar | Owner:
Type: proposal | Status: new
#3270: Stop using PackedString in template-haskell; drop packedstring as a
bootlib
---+
Reporter: simonmar | Owner:
Type: proposal | Status: new
#3269: Stop using PackedString in template-haskell; drop packedstring as a
bootlib
-+--
Reporter: simonmar |Owner:
Type: proposal | Status: closed
#2798: Enable rec keyword when RecursiveDo is enabled?
-+--
Reporter: nominolo |Owner:
Type: task | Status: new
Priority: high
#2798: Enable rec keyword when RecursiveDo is enabled?
-+--
Reporter: nominolo |Owner:
Type: task | Status: new
Priority: high
#3270: Stop using PackedString in template-haskell; drop packedstring as a
bootlib
-+--
Reporter: simonmar |Owner:
Type: proposal | Status: new
[ Reprise of an old GHCi problem, GHC HQ read on please... ]
Am Mittwoch, 20. Mai 2009 09:24:14 schrieb Matthijs Kooijman:
I've been playing around with GLUT (latest version from hackage, on Debian)
a bit yesterday and am having some troubles with renderString. It works
fine when I compile a
On Mon, 2009-06-01 at 20:05 +0200, Sven Panne wrote:
[ Reprise of an old GHCi problem, GHC HQ read on please... ]
Am Mittwoch, 20. Mai 2009 09:24:14 schrieb Matthijs Kooijman:
I've been playing around with GLUT (latest version from hackage, on Debian)
a bit yesterday and am having some
#698: GHC's internal memory allocator never releases memory back to the OS
-+--
Reporter: guest |Owner: igloo
Type: bug | Status: new
Am Montag, 1. Juni 2009 22:48:56 schrieb Duncan Coutts:
I don't know how the problem reported in that message is related to the
renderString problem (which I do not understand), but the behaviour you
see there is not terribly surprising. It's an artefact of the way
dynamic linking works and
#3132: x86 code generator generates bad FPU register names
---+
Reporter: int-e |Owner: nobody
Type: bug | Status: new
Priority: high|
On 29/05/2009 15:19, John Lask wrote:
- Original Message - From: Duncan Coutts
duncan.cou...@worc.ox.ac.uk
To: John Lask jvl...@hotmail.com
Sent: Friday, May 29, 2009 8:09 PM
Subject: Re: [Haskell-cafe] ghc - force library search order
On Fri, 2009-05-29 at 18:08 +1000, John Lask
I hav a module that depends upon (binds to) the microsoft uuid.lib
(libuuid.a) this is a static library which exports some labels such as
IID_IPersistFile. I was playing around with trying to get it to work both
with normal compiling via ghc and to dynamically load in ghci. As we know,
ghci
Hello haskell,
Interesting blog post comparing speed and expressiveness of many
languages:
http://gmarceau.qc.ca/blog/2009/05/speed-size-and-dependability-of.html
--
Best regards,
Bulat mailto:bulat.zigans...@gmail.com
___
Please consider submitting a talk proposal for the Haskell Implementers'
Workshop. I'm pretty excited about this meeting - it promises to be a
lively and enjoyable day. The deadline for submissions is a couple of
weeks away, all you have to do is write an abstract:
Thanks for the link. I find the expressiveness results odd. How can SML/NJ
be among the least expressive languages, while MLTON and OCAML are among the
most expressive? How is Smalltalk less expressive than Java? Why are Prolog
and Mercury among the least expressive?
I think it's a combination of
lists:
I think it's a combination of 1) the expressiveness measure is too simplistic,
measuring number of lines alone, or counting comments
It isn't measuring lines of code, it is measuring the Gzip compression
Also, there's a few bogons in the data (it was graphed against 2005-6
results, and
On Mon, Jun 1, 2009 at 1:58 PM, Lyle Kopnicky li...@qseep.net wrote:
Why are Prolog and Mercury among the least expressive?
Well, I don't know about SML/NJ, since I don't see anything obviously
wrong at
http://shootout.alioth.debian.org/gp4/benchmark.php?test=alllang=smlnjlang2=ghcbox=1
But
Hello Lyle,
Monday, June 1, 2009, 9:58:14 PM, you wrote:
Thanks for the link. I find the expressiveness results odd. How can
SML/NJ be among the least expressive languages, while MLTON and
OCAML are among the most expressive?
optimization tricks?
How is Smalltalk less
expressive than
gwern0:
On Mon, Jun 1, 2009 at 1:58 PM, Lyle Kopnicky li...@qseep.net wrote:
Why are Prolog and Mercury among the least expressive?
Well, I don't know about SML/NJ, since I don't see anything obviously
wrong at
Is there a Scrap Your Boilerplate guru out there who could whip up a three
argument version of gzip for me?
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Instead of GZip metrics for code size, maybe a good measure of
imperative language code size would be the cyclomatic complexity
metric.
It would also be interesting to see results for Fortran, Java, C++,
etc. across a range of old and newer compilers.
Can one measure cyclomatic complexity for
On Mon, Jun 1, 2009 at 8:20 PM, David Fox da...@seereason.com wrote:
Is there a Scrap Your Boilerplate guru out there who could whip up a three
argument version of gzip for me?
This can be done of course (untested but type-checked code follows).
Left wondering what the scenario might be :-)
Thank you! What I have in mind is three way merging - you have two
revisions based on the same original value, and you need to decide whether
they can be merged automatically or they need to be merged by a user. You
only have a real conflict when both revisions differ from the original and
On Mon, Jun 1, 2009 at 3:40 PM, Ralf Laemmel rlaem...@gmail.com wrote:
Thank you! What I have in mind is three way merging - you have two
revisions based on the same original value, and you need to decide
whether
they can be merged automatically or they need to be merged by a user.
You
Hello, all,
I'm hereby announcing Data.GDS, a small module to write and
(eventually -- that's part of the pre) read GDS files. For those of
you not in the semiconductor biz, GDS-II is one of the classic formats
of the industry. It's perhaps ever so slightly obsolete at this point,
as the OASIS
Hello Gwern,
Monday, June 1, 2009, 4:35:25 AM, you wrote:
GHC mangles UTF by default. You probably want to use one of the utf8
packages; eg.
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/utf8-string
or
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/utf8-light
Hi all,
I was looking for an APL-style iota function for array indices. I
noticed
range from Data.Ix which, with a zero for the lower bound (here
(0,0)),
gives the values I need:
let (a,b) = (2,3)
index ((0,0),(a-1,b-1))
[(0,0),(0,1),(0,2),(1,0),(1,1),(1,2)]
However, I need the
Hello all
I recently found strange problem in use of inf-haskell + ghci on my Mac OS
X Tyger. I haven't used inf-haskell for a some time, and several days ago
i found, that it stopped to work - when I run C-c C-l (load file) it signal
error, and when I perform C-c C-b (start interpreter) it load
On Jun 1, 2009, at 12:17 AM, Henning Thielemann wrote:
On Thu, 28 May 2009, Bulat Ziganshin wrote:
i use another approach which imho is somewhat closer to
interpretation
of logical operations in dynamic languages (lua, ruby, perl): [...]
The absence of such interpretations and thus the
The iota function you're looking for can be a whole lot simpler if you
know about monads (list monad in particular) and sequence. For lists,
sequence has the following behaviour:
sequence [xs1,xs2, ... xsn] =
[[x1,x2, ... , xn] | x1 - xs1, x2 - xs2, ... , xn - xsn]
Using this, you can
That is quite spectacular. I revised my knowledge of sequence
with a little function, akin to sequence [xs1,xs2]:
seq2 xs1 xs2 = do x1 - xs1
x2 - xs2
return [x1,x2]
seq2 [0,1] [0,1,2]
Greetings, fellow haskellers.
Currently I'm writing some kind of web crawler in haskell with gtk2hs gui.
All network operations are run in separate thread, but sometimes input
from user is needed. Afaik, gtk2hs is not thread safe, so I came up with
following:
I create two mvars, A and B,
Hello Dmitry,
Monday, June 1, 2009, 4:24:36 PM, you wrote:
All network operations are run in separate thread, but sometimes input
from user is needed. Afaik, gtk2hs is not thread safe, so I came up with
look for postGUISync and postGUIASync
--
Best regards,
Bulat
Hi,
I tried this code:
---
f, g :: a - a
(f, g) = (id, id)
---
Hugs: OK
GHC:
Couldn't match expected type `forall a. a - a'
against inferred type `a - a'
In the expression: id
In the expression: (id, id)
In a pattern binding:
Am Montag 01 Juni 2009 14:44:37 schrieb Vladimir Reshetnikov:
Hi,
I tried this code:
---
f, g :: a - a
(f, g) = (id, id)
---
Hugs: OK
GHC:
Couldn't match expected type `forall a. a - a'
against inferred type `a - a'
In the
On Mon, Jun 1, 2009 at 3:06 AM, Sebastian Fischer
s...@informatik.uni-kiel.de wrote:
On Jun 1, 2009, at 12:17 AM, Henning Thielemann wrote:
On Thu, 28 May 2009, Bulat Ziganshin wrote:
i use another approach which imho is somewhat closer to interpretation
of logical operations in dynamic
I went back and tried to convert the YAHT example to Monad, importing Monad,
commenting out all but the data descriptions and the searchAll function, and
finally replacing success, failure, augment, and combine in the searchAll
function with return, fail, =, and mplus.
*Main let g = Graph
On Sun, May 31, 2009 at 06:20:23PM -0700, Iavor Diatchki wrote:
and so on. It is a bit verbose, but you only have to do it once for
your protocol, and then you get the nice overloaded interface.
This also seems like the kind of thing perfectly suited to Template
Haskell. Especially if the
Dear Group,
I've spent the last few days trying to convert a bunch of mysql tables into
couchdb using haskell, and I've documented my efforts, in case anyone else
intends to wander in similar waters. The tutorial is at:
http://maztravel.com/haskell/mySqlToCouchDB.html
comments welcome here at
Am Montag 01 Juni 2009 19:02:36 schrieb michael rice:
All good so far, but then tried to convert Failable from Computation to
Monad
instance Monad Failable where
return = Success
fail = Fail
= (Success x) f = f x
= (Fail s) _ = Fail s
mplus (Fail _) y = y
mplus
Do you argue that overloading logical operations like this in Haskell
sacrifices type safety? Could programs go wrong [1] that use such
abstractions?
If I understand your point correctly, you are suggesting that such programs
are still type safe. I agree with the claim that such features are
And rename empty to fail? You managed to confuse me since I always
use pSucceed to recognise the empty string.
Doaitse
On 1 jun 2009, at 01:21, Ross Paterson wrote:
On Sun, May 31, 2009 at 09:40:38PM +0200, S. Doaitse Swierstra wrote:
A new version of the uu-parsinglib has been uploaded
I once thought, that error messages must be configurable by libraries,
too. This would be perfect for EDSLs that shall be used by non-Haskellers.
Yes, that is a problem.
But I have no idea how to design that.
There was some work in that direction in the context of the Helium
project. See
Got it.
Thanks!
Michael
--- On Mon, 6/1/09, Daniel Fischer daniel.is.fisc...@web.de wrote:
From: Daniel Fischer daniel.is.fisc...@web.de
Subject: Re: [Haskell-cafe] Missing a Deriving?
To: haskell-cafe@haskell.org
Date: Monday, June 1, 2009, 1:51 PM
Am Montag 01 Juni 2009 19:02:36 schrieb
Do you argue that overloading logical operations like this in
Haskell
sacrifices type safety? Could programs go wrong [1] that use such
abstractions?
If I understand your point correctly, you are suggesting that such
programs
are still type safe.
My asking was really meant as a question to
Hi,
(Relatively new to Haskell here ..)
So I have the following:
data MyVal = Atom String
| Bool Bool
And I want to do something like this
check :: (Bool - MyVal) - MyVal - True
check f (f x) = True
check _ _ = False
What that means is I want to pass a MyVal
Hi Dan,
On Mon, Jun 1, 2009 at 8:39 PM, Dan Cook danielkc...@gmail.com wrote:
Hi,
(Relatively new to Haskell here ..)
So I have the following:
data MyVal = Atom String
| Bool Bool
And I want to do something like this
check :: (Bool - MyVal) - MyVal - True
Still stumped. Maybe and [] are in the same MonadPlus monad, but how do I make
monad Failable understand mplus?
I'm now getting this error upon loading:
Prelude :l graph5
[1 of 1] Compiling Main ( graph5.hs, interpreted )
graph5.hs:36:4: `mplus' is not a (visible) method of class
mplus is a method of class MonadPlus, so you need to write it in a
separate instance from the one for Monad, e.g.
instance MonadPlus Failable where
mplus = ...
-Ross
On Jun 1, 2009, at 9:28 PM, michael rice wrote:
Still stumped. Maybe and [] are in the same MonadPlus monad, but how
do
Hi Ross,
I thought of that, but return, fail, and = became not visible when I
changed the instance declaration from Monad to MonadPlus.. Can Failable be in
two instance declarations, one for Monad (giving it return, fail, and =) and
one for MonadPlus (giving it mplus)?
Michael
--- On Mon,
Oh I wasn't clear -- you need multiple instance declarations for a
given type (Failable, for example), one for each type class you're
implementing.
That is,
instance Monad Failable where
return = ...
...
instance MonadPlus Failable where
mplus = ...
...
-Ross
On Jun 1, 2009,
I didn't know I could do that. Works fine. Output below. Thanks!
This is some pretty neat stuff, and I've only scratched the surface.
Michael
===
[mich...@localhost ~]$ ghci
GHCi, version 6.10.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ...
graph5.hs:37:9:
Warning: No explicit method nor default method for `mzero'
In the instance declaration for `MonadPlus Failable'
This warning is saying you didn't finish the declaration.
Try something like
instance MonadPlus Failable where
mplus (Fail _) y = y
mplus x _ = x
On 2 Jun 2009, at 3:39 pm, Dan Cook wrote:
Hi,
(Relatively new to Haskell here ..)
So I have the following:
data MyVal = Atom String
| Bool Bool
And I want to do something like this
check :: (Bool - MyVal) - MyVal - True
check f (f x) = True
check _ _ = False
What
My family and I are moving in the coming months. My wife will be
attending a new school in the fall. Among the many hassles of moving
are locating and transferring medical records to new doctors and
clinics. During our time in Minnesota, we've visited several clinics
and hospitals, so our
On Mon, Jun 1, 2009 at 11:18 PM, Tom Hawkins tomahawk...@gmail.com wrote:
My family and I are moving in the coming months. My wife will be
attending a new school in the fall. Among the many hassles of moving
are locating and transferring medical records to new doctors and
clinics. During
Hi Daniel,
Could you please explain what does mean 'monomorphic' in this context?
I thought that all type variables in Haskell are implicitly
universally quantified, so (a - a) is the same type as (forall a. a
- a)
Thank you,
Vladimir
On 6/1/09, Daniel Fischer daniel.is.fisc...@web.de wrote:
82 matches
Mail list logo
