#4141: Inconsistant .hi or .hi-boot compilation error
-+--
Reporter: odj |Owner:
Type: bug | Status: new
Priority: normal|Milestone:
#2717: Add nubWith, nubOrd
-+--
Reporter: Bart Massey | Owner:
Type: proposal| Status: new
Priority: normal | Milestone: Not GHC
#4148: improve new recursive do syntax
-+--
Reporter: guest |Owner:
Type: feature request | Status: new
Priority: normal|Milestone:
#4147: 'withFilePath' not in scope, windows build, using base 4.1.0.0
+---
Reporter: lcasburn |Owner: igloo
Type: bug | Status: new
#2717: Add nubWith, nubOrd
-+--
Reporter: Bart Massey | Owner:
Type: proposal| Status: new
Priority: normal | Milestone: Not GHC
#4148: improve new recursive do syntax
-+--
Reporter: guest |Owner:
Type: feature request | Status: new
Priority: normal|Milestone:
#4148: improve new recursive do syntax
-+--
Reporter: guest |Owner:
Type: feature request | Status: new
Priority: normal|Milestone:
#4148: improve new recursive do syntax
-+--
Reporter: guest |Owner:
Type: feature request | Status: new
Priority: normal|Milestone:
#3276: FilePath.addTrailingPathSeparator = /
+---
Reporter: duncan | Owner:
Type: bug| Status: closed
Priority: normal |
#3389: CPP strips out C-style comments
--+-
Reporter: nominolo | Owner: igloo
Type: feature request | Status: new
Priority: normal | Milestone:
#3389: CPP strips out C-style comments
--+-
Reporter: nominolo | Owner: igloo
Type: feature request | Status: new
Priority: normal | Milestone:
#4149: Make Permissions type abstract
+---
Reporter: igloo|Owner:
Type: proposal | Status: new
Priority: normal |Milestone:
#4149: Make Permissions type abstract
+---
Reporter: igloo|Owner:
Type: proposal | Status: new
Priority: normal |Milestone:
#3394: Make Permissions type abstract
--+-
Reporter: igloo| Owner:
Type: task | Status: closed
Priority: normal |
#3445: :show modules Panic
---+
Reporter: sfjohnso | Owner:
Type: bug | Status: closed
Priority: normal| Milestone: 6.14.1
#1338: base package breakup
-+--
Reporter: simonmar| Owner:
Type: task| Status: closed
Priority: low | Milestone: 6.14.1
#2362: allow full import syntax in GHCi
-+--
Reporter: Isaac Dupree |Owner: igloo
Type: feature request | Status: new
Priority: high |Milestone:
#2839: Integer not documented in latest docs
-+--
Reporter: TristanAllwood | Owner:
Type: bug | Status: closed
Priority: low | Milestone:
#2362: allow full import syntax in GHCi
-+--
Reporter: Isaac Dupree |Owner: igloo
Type: feature request | Status: new
Priority: high |Milestone:
#2362: allow full import syntax in GHCi
-+--
Reporter: Isaac Dupree |Owner: igloo
Type: feature request | Status: new
Priority: high |Milestone:
#4150: CPP+QuasiQuotes confuses compilation errors' line numbers
+---
Reporter: yairchu | Owner:
Type: bug | Status: new
#3449: Unavoidable unused bindings warnings in boot files
-+--
Reporter: heatsink |Owner: igloo
Type: bug | Status: new
Priority: normal|
#3389: CPP strips out C-style comments
--+-
Reporter: nominolo | Owner: igloo
Type: feature request | Status: new
Priority: normal | Milestone:
#4151: Validate fails with GhcRtsWithPapi = YES
-+--
Reporter: dmp | Owner: dmp
Type: bug | Status: new
Priority: normal| Component:
#4151: Validate fails with GhcRtsWithPapi = YES
-+--
Reporter: dmp | Owner: dmp
Type: bug | Status: merge
Priority: normal| Component:
#4152: Add support for collecting native events with PAPI
-+--
Reporter: dmp | Owner: dmp
Type: feature request | Status: new
Priority: normal|
#4152: Add support for collecting native events with PAPI
-+--
Reporter: dmp | Owner: dmp
Type: feature request | Status: patch
Priority: normal|
#4152: Add support for collecting native events with PAPI
-+--
Reporter: dmp | Owner: dmp
Type: feature request | Status: patch
Priority: normal|
#4151: Validate fails with GhcRtsWithPapi = YES
-+--
Reporter: dmp | Owner: dmp
Type: bug | Status: merge
Priority: normal| Component:
Right, I wouldn't use DList for this. Here's an alternative I use:
data AList a = ANil | ASing a | Append (AList a) (AList a)
lenA :: AList a - Int
lenA ANil = 0
lenA (ASing _) = 1
lenA (Append l r) = lenA l + lenA r
appendA ANil r = r
appendA l ANil = l
appendA l r =
On Sat, Jun 19, 2010 at 8:46 AM, Claus Reinke claus.rei...@talk21.com
wrote:
I put the simple version at
http://hpaste.org/fastcgi/hpaste.fcgi/view?id=26329#a26329
This one displays much better performance with DList + Writer.Strict
than List + StrictWriter so I guess it's not too surprising.
There's also an underlying semantic issue, which is not yet resolved.
The GHC implementation of mdo (following Levent and John's paper)
performs a dependency analysis on the statements in the mdo to apply
mfix to the shortest possible subsegments of statements. For example,
mdo
a - f b
Sebastian Fischer wrote:
I am interested in the mentioned laws because I want to show the monad
laws for the definition
instance Monad FreeMonoid where
return x = FreeMonoid ($x)
a = f = a - f
This definition of `=` is *not* the usual one for continuation monads,
but if the
*** Apologies for multiple copies ***
Call for Participation
---
SSFRR 2010
SICSA Summer School on Formal Reasoning Representation of Complex Systems
14-15 August 2010 -- Heriot-Watt University campus -- Edinburgh
Satellite summer school of VSTTE 2010
Dear Haskellers,
this summer school contains bits of formal methods and language design
that typically intersect very well with interests on this list.
Looking forward to meet some of you in Koblenz.
Ralf
8 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
CALL FOR
On 23 Jun 2010, at 10:25, Giuseppe Luigi Punzi Ruiz wrote:
I uninstalled all ports and macports, to try with gtk-osx
Once I did all of this, leksah builds, but leksah-server don't, with problems
with version of libgthread2.
I am confused leksah depends on leksah-server so I am not sure how
I think your problem here is that there's no mention of `a' on the
left-hand size of from_val's type signature; you either need to use
MPTC+fundep to associate what result is compared to a, or else use a
phantom type parameter of Val to make it data Val result a = ... and
then from_val :: Val
Hello ajb,
Wednesday, June 23, 2010, 6:58:30 AM, you wrote:
build ((w1,t1):(w2,t2):wts)
= build $ insertBy (comparing fst) (w1+w2, Node t1 t2) wts
this algo is O(n^2). to be O(n) you should handle separate lists of
leafs and nodes, adding new nodes to the tail of second list
--
| I think your problem here is that there's no mention of `a' on the
| left-hand size of from_val's type signature; you either need to use
| MPTC+fundep to associate what result is compared to a, or else use a
| phantom type parameter of Val to make it data Val result a = ... and
| then
I'm interested in situations where you think fundeps work and type families
don't. Reason: no one knows how to make fundeps work cleanly with local type
constraints (such as GADTs).
If you think you have such as case, do send me a test case.
Well, from looking at the documentation, it
I'm interested in situations where you think fundeps work
and type families don't. Reason: no one knows how to make
fundeps work cleanly with local type constraints (such as GADTs).
If you think you have such as case, do send me a test case.
Do you have a wiki page somewhere collecting
Hi Hamish, list...
El mié, 23-06-2010 a las 18:09 +1200, Hamish Mackenzie escribió:
On 23 Jun 2010, at 10:25, Giuseppe Luigi Punzi Ruiz wrote:
I uninstalled all ports and macports, to try with gtk-osx
Once I did all of this, leksah builds, but leksah-server don't, with
problems with
On 23/06/10 06:54, Christopher Done wrote:
I'm not sure how Alternative differs from MonadPlus, other than being
defined for Applicative rather than Monad. They have the same laws
(identity and associativity).
Importantly, MonadPlus must satisfy some laws for (=) and (),
whereas
I haven't seen HWN in a while. If there is still community interest,
how can we help you with this?
-deech
On Wed, Apr 28, 2010 at 2:45 AM, Joe Fredette jfred...@gmail.com wrote:
While I would not be opposed to being paid, I don't think it's at all
necessary or even really appropriate. I liken
2010/6/23 aditya siram aditya.si...@gmail.com:
I haven't seen HWN in a while. If there is still community interest,
how can we help you with this?
It will come back, see this thread:
http://www.reddit.com/r/haskell/comments/cdw38/hwn_it_will_be_back_promise/
Cheers,
Thu
Neat. Thanks!
-deech
On Wed, Jun 23, 2010 at 10:06 AM, Vo Minh Thu not...@gmail.com wrote:
2010/6/23 aditya siram aditya.si...@gmail.com:
I haven't seen HWN in a while. If there is still community interest,
how can we help you with this?
It will come back, see this thread:
From: Max Rabkin max.rab...@gmail.com
This seems like an example of list-chauvinism -- what Chris Okasaki
calls a communal blind spot of the FP community in Breadth-First
Numbering: Lessons from a Small Exercise in Algorithm Design --
http://www.eecs.usma.edu/webs/people/okasaki/icfp00.ps
I made (presumably) inefficient huffman algorithm not too long ago:
http://www.hpaste.org/fastcgi/hpaste.fcgi/view?id=26484#a26484
I guess it doesn't normally need to be terribly efficient as the
result can be stored in a map of some sort.
On Wed, Jun 23, 2010 at 10:41 PM, John Lato
On Wed, Jun 23, 2010 at 03:41:29PM +0100, John Lato wrote:
How would you implement bfnum? (If you've already read the paper,
what was your first answer?)
This was my first answer, and it is wrong, but I thought it was
slightly clever, so here it is:
bfnum :: Tree a - Tree Int
bfnum tree =
On Wed, Jun 23, 2010 at 4:35 PM, Daniel Lyons fus...@storytotell.org wrote:
On Wed, Jun 23, 2010 at 03:41:29PM +0100, John Lato wrote:
How would you implement bfnum? (If you've already read the paper,
what was your first answer?)
This was my first answer, and it is wrong, but I thought it
On Wed, Jun 23, 2010 at 05:41:17PM +0100, John Lato wrote:
If this answer did work, I don't think the question would be
interesting.
We don't have to be mean. - Buckaroo Banzai.
--
Daniel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Tue, Jun 22, 2010 at 4:54 PM, Gregory Crosswhite
gcr...@phys.washington.edu wrote:
There is no reason that your program couldn't link to multiple versions of
the same package so that each library can access the version that it needs.
In fact, GHC already does this, doesn't it? For
I'm the new maintainer of the FastCGI package[1].
Please upgrade to the latest version, 3001.0.2.3. It includes a fix
for a special but real case in which the library throws an exception
when the httpd server unexpectedly closes the connection[2], and the
base version and exceptions have been
On 6/23/10 2:13 PM, Edward Kmett wrote:
On Tue, Jun 22, 2010 at 4:54 PM, Gregory Crosswhite
gcr...@phys.washington.edu mailto:gcr...@phys.washington.edu wrote:
There is no reason that your program couldn't link to multiple
versions of the same package so that each library can access
-- Algorithms From: Selected Papers on Design of Algorithms, Donald
Knuth, 2010
-- Chapter 10 Addition Machines
-- Haskell version by Casey Hawthorne
-- Note this is only a skeleton of the chapter,
-- so as to wet your interest to buy the book.
-- Addition Machine
-- The only operations
-- Algorithms From: Selected Papers on Design of Algorithms, Donald
Knuth, 2010
-- Chapter 10 Addition Machines
-- Haskell version by Casey Hawthorne
-- Note this is only a skeleton of the chapter,
-- so as to wet your interest to buy the book.
-- Addition Machine
-- The only operations
Hello!
On Wed, Jun 23, 2010 at 2:19 PM, cas...@istar.ca wrote:
-- Algorithms From: Selected Papers on Design of Algorithms, Donald Knuth,
2010
-- Chapter 10 Addition Machines
-- Haskell version by Casey Hawthorne
-- Note this is only a skeleton of the chapter,
-- so as to wet your
On Wed, Jun 23, 2010 at 2:57 PM, Gregory Crosswhite
gcr...@phys.washington.edu wrote:
On 6/23/10 2:13 PM, Edward Kmett wrote:
On Tue, Jun 22, 2010 at 4:54 PM, Gregory Crosswhite
gcr...@phys.washington.edu wrote:
There is no reason that your program couldn't link to multiple versions of
On 6/23/10 3:29 PM, Edward Kmett wrote:
Yes, and that problem still isn't resolved in another since, since
they share the same module names, but as of yet, still provide an
incompatible API. I can't (yet) provide 'RightSemiNearRing' instances
that work with both the monad transformers from
Yah, this is gonna sound like a crappy thing -- but my computer is
still broken. What I thought was a faulty SATA port seems to actually
be an issue with the harddrive, so -- one more week is the punchline.
I'm really sorry guys...
/Joe
On Jun 23, 2010, at 10:13 AM, aditya siram wrote:
Hello,
I have been reading work done at Rice University:
http://habanero.rice.edu/cnc. Some work has been done by
http://www.cs.rice.edu/~dmp4866/ on CnC for .Net. One component that David
wrote a CnC translator that translates CnC textual form to the underlying
language, e.g. F#. Is anybody
vigalchin:
Hello,
I have been reading work done at Rice University: http://
habanero.rice.edu/cnc. Some work has been done by http://www.cs.rice.edu/
~dmp4866/ on CnC for .Net. One component that David wrote a CnC translator
that
translates CnC textual form to the underlying
On Wed, Jun 23, 2010 at 11:50 AM, Daniel Lyons fus...@storytotell.org wrote:
On Wed, Jun 23, 2010 at 05:41:17PM +0100, John Lato wrote:
If this answer did work, I don't think the question would be
interesting.
We don't have to be mean. - Buckaroo Banzai.
I certainly didn't want to upset
Hello all,
I am currently playing with Paul Hudak's Euterpea (a music program, formely
called Haskore) and I am trying to teach it about rhythm.
I said that a rhythm is a series of Moments (or Beats), each expressed as
fractions of a bar. But each Moment also has volume. So I could model
On Wed, Jun 23, 2010 at 3:47 PM, Don Stewart d...@galois.com wrote:
vigalchin:
Hello,
I have been reading work done at Rice University: http://
habanero.rice.edu/cnc. Some work has been done by
http://www.cs.rice.edu/
~dmp4866/ on CnC for .Net. One component that David wrote a
On 15/06/10 09:08, Amiruddin Nagri wrote:
I wanted some insight as to how Haskell is going to help me with my
project. Also there has been some concerns because of lazy evaluation
in Haskell and memory leaks associated with it.
This seems like an example of list-chauvinism -- what Chris Okasaki
calls a communal blind spot of the FP community in Breadth-First
Numbering: Lessons from a Small Exercise in Algorithm Design --
http://www.eecs.usma.edu/webs/people/okasaki/icfp00.ps
Thanks for sharing; this was an
On Jun 23, 2010, at 1:50 PM, Martin Drautzburg wrote:
I said that a rhythm is a series of Moments (or Beats), each
expressed as
fractions of a bar. But each Moment also has volume. So I could
model rhythm
as Pairs of (Moment, Volume). However I certanly do not want to
specify both
the
Edward Kmett ekm...@gmail.com writes:
One much weaker consideration is that out of the 23+ direct dependencies on
fgl, fully half of them don't bother to specify an upper bound on the fgl
version and would break immediately. That said, those packages are out of
compliance with package
I know some haskell people out there have done what I am trying to do,
and I hope you can help me out. I've got access to a debian server
which is running a Xen Hypervisor 3.0.3 I believe. I would like to
install archlinux as a paravirtual machine (or HVM if I must) in order
to get a more
On Jun 22, 2010, at 1:26 PM, Maurí cio CA wrote:
Sure, Huffman was actually my first tought. But I couldn't think
of a pratical display for the result of Huffman encoding that
could be easily followed by a human looking at the screen. Since
it's an optimal code, letters would not be grouped in
On Wed, Jun 23, 2010 at 2:30 PM, Paul Johnson p...@cogito.org.uk wrote:
On 15/06/10 09:08, Amiruddin Nagri wrote:
I wanted some insight as to how Haskell is going to help me with my
project. Also there has been some concerns because of lazy evaluation in
Haskell and memory leaks associated
On 23 June 2010 19:57, Gregory Crosswhite gcr...@phys.washington.edu wrote:
cabal is the only mechanism that the vast majority of Haskell-users know how
to use these days. Resolving diamond dependencies safely relies on knowing
tha tthe use of different libraries is entirely internal to the
Hello list,
let's say I would like to create 4 buttons where any one button can
respond to a click and notify every other button.
Ie. where the 1st button is wired with the 2nd, the 2nd with the 3rd ...
and the 4th button with the 1st.
In short I would like these buttons to be connected as
On Thu, Jun 24, 2010 at 02:35:55AM +0200, Günther Schmidt wrote:
Is that something that MonadFix is meant to be used for?
In current Gtk libraries, no. You'll do something like
do btns - mapM createBtn [1..4]
mapM_ connect $ zip btns (tail $ cycle btns)
However, if some library
On 6/23/10 8:06 PM, Duncan Coutts wrote:
Consider an example where we want to avoid using two versions of a dependency:
The htar program depends on the tar and zlib packages. The tar and
zlib packages depend on bytestring. Both tar and zlib export functions
that use the type ByteString. The
On Wed, 2010-06-23 at 21:05 -0400, Gregory Crosswhite wrote:
On 6/23/10 8:06 PM, Duncan Coutts wrote:
Consider an example where we want to avoid using two versions of a
dependency:
The htar program depends on the tar and zlib packages. The tar and
zlib packages depend on bytestring.
Sure, Huffman was actually my first tought. But I couldn't think
of a pratical display for the result of Huffman encoding that
could be easily followed by a human looking at the screen. Since
it's an optimal code, letters would not be grouped in alphabetical
order.
There is a compromise.
There
Hi Rami,
You'll want to first look at the Cmm (C minus minus) code, which is the
imperative intermediate language that GHC uses before conversion to assembly.
Do something like ghc -c Whatever.hs -ddump-cmm. The names of the blocks of
cmm code should match the ones in core. If not, then you
79 matches
Mail list logo
