#2076: rational infinities don't compare correctly to each other
---+
Reporter: uhollerbach | Owner: jeffrey
Type: bug | Status: closed
Priority: normal
#709: Fixup too large error with -fasm on PowerPC
--+-
Reporter: simonmar | Owner:
Type: bug | Status: patch
Priority:
#7445: template-haskell : need a good error message instead of just an
unexplained
panic
---+
Reporter: erikd | Owner:
Type: bug | Status: new
#7445: template-haskell : need a good error message instead of just an
unexplained
panic
---+
Reporter: erikd | Owner:
Type: bug | Status: new
#7462: New nofib benchmark for unpacked arrays and floating point arithmetic
--+-
Reporter: tibbe | Owner:
Type: feature request| Status: patch
#7445: template-haskell : need a good error message instead of just an
unexplained
panic
---+
Reporter: erikd | Owner:
Type: bug | Status: new
#6017: Reading ./.ghci files raises security issues
-+--
Reporter: nomeata | Owner: pminten
Type: task | Status: patch
Priority: high |
#7476: -ddump-minimal-imports confused if first line is an import
-+--
Reporter: dag | Owner: simonpj
Type: bug | Status: new
Priority: normal
#7468: incorect waiting for packets on UDP connections.
--+-
Reporter: ET | Owner:
Type: bug | Status: closed
#7478: setSessionDynFlags does not always work
-+--
Reporter: edsko | Owner:
Type: bug | Status: new
Priority: normal|
#7478: setSessionDynFlags does not always work
-+--
Reporter: edsko | Owner:
Type: bug | Status: new
Priority: normal|
#7439: Include dynamic-by-default support in Cabal with GHC 7.6.2
-+--
Reporter: igloo | Owner: igloo
Type: bug | Status: new
Priority: highest
#7478: setSessionDynFlags does not always work
-+--
Reporter: edsko | Owner:
Type: bug | Status: new
Priority: normal|
#7479: ArrowChoice unit law in haddock seems to be wrong
--+-
Reporter: pminten| Owner:
Type: bug| Status: new
Priority: normal |
#7479: ArrowChoice unit law in haddock seems to be wrong
--+-
Reporter: pminten| Owner:
Type: bug| Status: merge
Priority: normal |
#7162: RULES that never fire (automatically)
---+
Reporter: andygill | Owner:
Type: feature request | Status: new
Priority: normal|
#7320: GHC crashes when building on 32-bit Linux in a Linode
---+
Reporter: benl| Owner: simonmar
Type: bug | Status: new
Priority: high
#7462: New nofib benchmark for unpacked arrays and floating point arithmetic
+---
Reporter: tibbe | Owner:
Type: feature request| Status: closed
#7480: Proposal: Add Functor instances for ArgOrder, OptDescr and ArgDescr
-+--
Reporter: basvandijk| Owner:
Type: feature request | Status: new
Priority:
#709: Fixup too large error with -fasm on PowerPC
--+-
Reporter: simonmar | Owner:
Type: bug | Status: patch
Priority:
On 03/12/12 20:11, Joachim Breitner wrote:
Dear Michał,
Am Sonntag, den 02.12.2012, 22:44 +0100 schrieb Michał J. Gajda:
On 12/02/2012 09:20 PM, Joachim Breitner wrote:
I noticed that Ubuntu, as well as Debian and original packages come
without some variants of threaded debugging binaries.
A
Hi!
I'm currently trying to extend ghc-vis[1], a tool to visualize live data
structures in GHCi and GHC compiled programs, similar to GHCi's :print and
vacuum.
I want to show the type of a subexpression visualized in ghc-vis. As types
aren't stored in GHC they have to be reconstructed. For this
Now I'm wondering whether the approaches I have in mind are sensible or if
anyone can think of a better way to achieve my goals? Is there a way to extend
GHCi without copying some of its source code? Is there a chance of having
these
features flow back into mainline GHCi once they are
Simon Marlow marlo...@gmail.com:
This has some advantages and some disadvantages, so we need to make a
decision about what we want to do in GHC 7.8. There are also some policy
questions we need to answer about how Cabal will work with a GHC that
uses dynamic libraries by default. We would like
Agreed. I'd much rather never again problems in ghci + linking,
Its one of the biggest sources of exotic bugs for new haskellers on OS X,
for all that i've never quite managed to ever pin down a simple test case
to replicate those problems
point being: ghci should do normal dynamic linking for
I'm curious how much of the compile twice situation for static and
dynamic libraries could actually be shared. Even if it's not likely to be
implemented in the next year or two, IMO it would make a big difference if
it were feasible to generate both static and dynamic libraries at the same
time
On 01/12/2012, at 1:42 AM, Simon Peyton-Jones wrote:
| While writing a new nofib benchmark today I found myself wondering
| whether all the nofib benchmarks are run just before each release,
I think we could do with a GHC Performance Tsar. Especially now that Simon
has changed jobs, we
Hi Haskellers,
since it is Advent time you might like to listen to a song that I programmed
and performed with the Haskell Live-Sequencer [1]:
http://www.youtube.com/watch?v=O5k0wUh0lj8
and you might want to check the Live-Sequencer, too. The Live-Sequencer allows
to compose songs in
Thank you! Very cool.
On Tue, Dec 4, 2012 at 9:44 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
Hi Haskellers,
since it is Advent time you might like to listen to a song that I
programmed and performed with the Haskell Live-Sequencer [1]:
Hi Tillmann,
is a shallow embedded DSL == an internal DSL and a deeply embedded DSL == an
external DSL or the other way around?
--Joerg
On Dec 3, 2012, at 11:40 PM, Tillmann Rendel wrote:
Hi,
Joerg Fritsch wrote:
I am working on a DSL that eventuyally would allow me to say:
import
On Tue, Dec 4, 2012 at 4:53 PM, Joerg Fritsch frit...@joerg.cc wrote:
is a shallow embedded DSL == an internal DSL and a deeply embedded DSL ==
an external DSL or the other way around?
Roughly speaking, yes. But a deep DSL doesn't mean you've got to have a
parser tokenizer IO input. You can
Hi,
I'm trying to parse a rather simple but big JSON message, but it turns
out that memory consumption is a problem, and I'm not sure what the
actual cause is.
Let's say we have a simple JSON message: an array of 5 million numbers.
I would like to parse this in constant space, such that if I
Aeson doesn't have an incremental parser so it'll be
difficult/impossible to do what you want. I guess you want an
event-based JSON parser, such as yajl [1]. I've never used this
library, though.
Cheers,
[1] http://hackage.haskell.org/package/yajl-0.3.0.5
On Tue, Dec 4, 2012 at 12:11 PM,
On Tue, Dec 04, 2012 at 12:23:19PM -0200, Felipe Almeida Lessa wrote:
Aeson doesn't have an incremental parser so it'll be
difficult/impossible to do what you want. I guess you want an
event-based JSON parser, such as yajl [1]. I've never used this
library, though.
Ah, I see. Thanks, I
Aeson is used for the very common usecase of short messages that need to be
parsed as quickly as possible into a static structure. A lot of things are
sacrificed to make this work, such as incremental parsing and good error
messages. It works great for web APIs like twitter's.
I didn't even know
On Tue, Dec 04, 2012 at 09:47:52AM -0500, Clark Gaebel wrote:
Aeson is used for the very common usecase of short messages that need to be
parsed as quickly as possible into a static structure. A lot of things are
sacrificed to make this work, such as incremental parsing and good error
Iustin Pop ius...@google.com writes:
[...]
Let's say we have a simple JSON message: an array of 5 million numbers.
I would like to parse this in constant space, such that if I only need
the last element, overall memory usage is low (yes, unrealistic use, but
please bear with me for a
Clark Gaebel cgae...@uwaterloo.ca writes:
[...]
I didn't even know people used JSON to store millions of integers. It
sounds like fun.
Actually, JSON is quite convenient if you need a standardized common
interchange format between Python, Ruby, JS et al. based components as
it directly maps
On Tue, Dec 04, 2012 at 03:58:24PM +0100, Herbert Valerio Riedel wrote:
Iustin Pop ius...@google.com writes:
[...]
Let's say we have a simple JSON message: an array of 5 million numbers.
I would like to parse this in constant space, such that if I only need
the last element, overall
Hi haskellers,
I've been having problems to access hackage.haskell.org for the past
2-4 hours. Is everything ok?
Cheers,
Ivan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Students! You have until Sunday to apply for funding to come to both
POPL and PLMW!
CALL FOR PARTICIPATION
SIGPLAN Programming Languages Mentoring Workshop, Rome
Tuesday January 22, 2013
Co-located with POPL 2013
PLMW web page: http://www.doc.ic.ac.uk/~gds/PLMW/index.html
After the
Down for me.
On Tue 04 Dec 2012 15:44:10 GMT, Ivan Perez wrote:
Hi haskellers,
I've been having problems to access hackage.haskell.org for the past
2-4 hours. Is everything ok?
Cheers,
Ivan
___
Haskell-Cafe mailing list
Works for me.
On Tue, Dec 4, 2012 at 11:03 AM, Niklas Hambüchen m...@nh2.me wrote:
Down for me.
On Tue 04 Dec 2012 15:44:10 GMT, Ivan Perez wrote:
Hi haskellers,
I've been having problems to access hackage.haskell.org for the past
2-4 hours. Is everything ok?
Cheers,
Ivan
In Haskell, shallow DSLs generate values - deep DSLs generate
structures (typically abstract syntax trees), the structure can
subsequently be used to generate a value (or a C program, or a HTML
page, etc.).
See Andy Gill and colleagues Types and Type Families for Hardware
Simulation and
I don't mean to be blunt, but have you guys taken a course in linear
algebra?
On Mon, Dec 3, 2012 at 9:21 PM, Trevor L. McDonell
tmcdon...@cse.unsw.edu.au wrote:
As far as I am aware, the only description is in the Repa paper. I you are
right, it really should be explained properly
No. But that doesn't stop me from being curious with Accelerate. Might you
have a better explaination for what's happening here than Trevor's?
- Clark
On Tue, Dec 4, 2012 at 7:08 PM, Alexander Solla alex.so...@gmail.comwrote:
I don't mean to be blunt, but have you guys taken a course in
Well, an m x n matrix corresponds to a linear transformation in at most
min{m,n} dimensions. In particular, this means that a 2x2 matrix
corresponds to a plane, line, or the origin of 3-space, as a linear
subspace. Which of those the matrix corresponds to depends on the matrix's
rank, which is
Sorry, I didn't realize that course was offered next year. I read through
Matrices and Linear Algebra when I was in high school. And used
Friedberg, Insel, Spence's Linear Algebra in college.
On Tue, Dec 4, 2012 at 4:37 PM, Alexander Solla alex.so...@gmail.comwrote:
Well, an m x n matrix
Thanks for the insight Alex.
In case you are concerned, Accelerate is not in fact a linear algebra library.
On 05/12/2012, at 11:43 AM, Alexander Solla alex.so...@gmail.com wrote:
Sorry, I didn't realize that course was offered next year. I read through
Matrices and Linear Algebra when I
Thanks! I'll read through Matricies and Linear Algebra over the next few
days.
- Clark
On Tue, Dec 4, 2012 at 7:43 PM, Alexander Solla alex.so...@gmail.comwrote:
Sorry, I didn't realize that course was offered next year. I read through
Matrices and Linear Algebra when I was in high
Hi,
Joerg Fritsch wrote:
is a shallow embedded DSL == an internal DSL and a deeply embedded DSL == an
external DSL or the other way around?
I mean internal == embedded, independently of deep vs. shallow,
following Martin Fowler [1].
Tillmann
[1]
Little things to check understanding:
* ghc/ghci implements a DSL called Haskell -- does it do so in a deep or
shallow way?
* where are the shallow DSLs? the deep ones? (hint: some of them are right
under our very noses!)
-- Kim-Ee
On Wed, Dec 5, 2012 at 12:49 AM, Stephen Tetley
I hope you can help me confirm my understanding of the order of kinds
and rank of types as reported in [1,2]. I have been validating the
mapping functions in Section 2 against the GHC 7.4.2 type checker by
explicitly annotating the universal quantifiers as described in [1].
1. Just to
On Wed, Dec 5, 2012 at 8:32 AM, Tillmann Rendel
ren...@informatik.uni-marburg.de wrote:
I mean internal == embedded, independently of deep vs. shallow, following
Martin Fowler [1].
[1]
I am doing, for several months, constant-space processing of large XML
files using iteratees. The file contains many XML elements (which are
a bit complex than a number). An element can be processed
independently. After the parser finished with one element, and dumped
the related data, the
Hi Oleg,
On Tue, Dec 4, 2012 at 9:13 PM, o...@okmij.org wrote:
I am doing, for several months, constant-space processing of large XML
files using iteratees. The file contains many XML elements (which are
a bit complex than a number). An element can be processed
independently. After the
On Tue, Dec 4, 2012 at 9:37 PM, Johan Tibell johan.tib...@gmail.com wrote:
Hi Oleg,
On Tue, Dec 4, 2012 at 9:13 PM, o...@okmij.org wrote:
I am doing, for several months, constant-space processing of large XML
files using iteratees. The file contains many XML elements (which are
a bit
Kim-Eeh, Tillmann,
I am interested in the definition of deep vs shallow embedded, even if it is
not featured in the Fowler textbook. Fowler that is one textbook only and I
am not focused on it.
--Joerg
On Dec 5, 2012, at 2:59 AM, Kim-Ee Yeoh wrote:
On Wed, Dec 5, 2012 at 8:32 AM, Tillmann
On Fri, Nov 30, 2012 at 02:41:51PM +0100, Fabio Riga wrote:
2012/11/30 Magnus Therning mag...@therning.org
On Thu, Nov 29, 2012 at 9:50 PM, Ramana Kumar ram...@member.fsf.org wrote:
[haskell] and [haskell-web] are out of sync at the moment.
I would say that github repository of [haskell] is
59 matches
Mail list logo
