#7056: GHCi loadArchive libiconv.a:failed Unknown PEi386 section name
`.drectve'
+---
Reporter: songpp | Owner:
Type: bug | Status: new
#7057: Simplifier infinite loop regression
+---
Reporter: ronwalf | Owner:
Type: bug | Status: new
Priority: normal |
#7057: Simplifier infinite loop regression
+---
Reporter: ronwalf | Owner:
Type: bug | Status: new
Priority: normal |
#7058: Add strict version of modifySTRef
-+--
Reporter: joeyadams| Owner:
Type: feature request | Status: new
Priority: normal
#7059: Error: junk `naughty I386 byte register' after expression
-+--
Reporter: erikd| Owner:
Type: bug | Status: new
Priority: normal |
Couldn't we use \\ for multi-case lambdas with layout?
If not, these are my preferences in order (all are single argument versions):
1: Omission: case of. There seems to be some support for this but it
was not included in the summary.
2: Omission with clarification: \case of
3: \of - but I think
Quoting Jonas Almström Duregård jonas.dureg...@chalmers.se:
Couldn't we use \\ for multi-case lambdas with layout?
Actually, \\ is a valid (infix) function name... and the base library
includes one in Data.List. That name is copied in several other
container interfaces, as well.
~d
On 07/07/2012, Jonas Almström Duregård jonas.dureg...@chalmers.se wrote:
Couldn't we use \\ for multi-case lambdas with layout?
If not, these are my preferences in order (all are single argument
versions):
1: Omission: case of. There seems to be some support for this but it
was not included
On July 7, 2012 00:08:26 Tyson Whitehead wrote:
The very limited scope of this (i.e., it would only apply to lines that end
with a grouping construct where the next line is indented further than that
line) should also address Simon's concerns regarding things like
f x y = x + y
If we're voting
I think \of is all right, and multi-argument case could be handy,
which rules out using 'case of' for lambda case, because it's the
syntax for a 0-argument case:
case of
| guard1 - ...
| guard2 - ...
Then multi-argument lambda case could use the comma syntax
On Fri, 6 Jul 2012, Dan Burton wrote:
Following the announcement of lens-family, I'm pleased to announce
lens-family-th 0.1.0.0, a Template Haskell library supplying macros to generate
lens-family lenses for fields of data types declared with record syntax.
Be warned that currently, type
Do you know why they switched over in GHC 6.6?
If I were to speculate, I'd say it is related to GADTs. Before GADTs,
we can keep conflating quantified type variables with schematic type
variables. GADTs seem to force us to make the distinction.
Consider this code:
data G a where
GI :: Int
On Thu, 5 Jul 2012, gdwe...@iue.edu wrote:
Sifflet and sifflet-lib 2.0.0.0, now available on Hackage!
This version introduces a type checker and partial support
for higher order functions in Sifflet, the visual, functional
programming language and support system for students learning
about
On Fri, 6 Jul 2012, Dan Burton wrote:
Following the announcement of lens-family, I'm pleased to announce
lens-family-th 0.1.0.0, a Template Haskell library supplying macros to generate
lens-family lenses for fields of data types declared with record syntax.
Be warned that currently, type
On Sat, 7 Jul 2012, rocon...@theorem.ca wrote:
On Fri, 6 Jul 2012, Dan Burton wrote:
Following the announcement of lens-family, I'm pleased to announce
lens-family-th 0.1.0.0, a Template Haskell library supplying macros to
generate
lens-family lenses for fields of data types declared with
Hello,
I've been out of the Haskell game for a bit, but now I'm back. A couple of
years ago I made a small library that implements relational algebra with
types so that malformed queries and other operations are caught at compile
time. It is heavily based off of the internals of HaskellDB (see
I don't know if it is possible to add haddock to functions whose type
signatures are generated by template haskell.
Could the documentation be an argument of mkLenses?
Does haddock run on the template-haskell expanded code?
--
Russell O'Connor
I don't know if it is possible to add haddock to functions whose type
signatures are generated by template haskell.
Could the documentation be an argument of mkLenses?
Does haddock run on the template-haskell expanded code?
TH macros must have type Q [Dec]. Dec has no constructor for
On Sat, 7 Jul 2012, Dan Burton wrote:
Could the documentation be an argument of mkLenses?
Does haddock run on the template-haskell expanded code?
TH macros must have type Q [Dec]. Dec has no constructor for comments, with the
exception of pragmas. This
might be feature request worthy,
Paul Visschers m...@paulvisschers.net wrote:
I've been out of the Haskell game for a bit, but now I'm back. A
couple of years ago I made a small library that implements relational
algebra with types so that malformed queries and other operations are
caught at compile time. It is heavily based
I'd be interested in at least playing with it.
On Saturday, July 7, 2012, Paul Visschers wrote:
Hello,
I've been out of the Haskell game for a bit, but now I'm back. A couple of
years ago I made a small library that implements relational algebra with
types so that malformed queries and
I found the solution to this problem: for both libraries, I had to wrap
calls in 'withRTSSignalsBlocked' from HDBC-mysql.
On 16 June 2012 00:32, William Shackleton w.shackle...@gmail.com wrote:
Hi
I'm having issues with HDBC when connecting to a remote MySQL server -
certain queries cause
Hi All:
I'm still working through the following paper [1] and I wondered whether
you could help me confirm my understanding of some sample terms and
program output from the Tc Monad. For those interested, the language is
specified in Parser.lhs available in the protoype here [2].
I understand
All,
After my message of yesterday [1] I got down to it and implemented
something along those lines. I created a playground repository
containing the code at [2]. Initial benchmark results at [3]. More about
the benchmark at the end of this email.
First some questions and requests for help:
-
On Sat, 7 Jul 2012, Paul Visschers m...@paulvisschers.net wrote:
Hello,
I've been out of the Haskell game for a bit, but now I'm back. A couple of
years ago I made a small library that implements relational algebra with
types so that malformed queries and other operations are caught at
On Sat, Jul 7, 2012 at 9:13 PM, Nicolas Trangez nico...@incubaid.com wrote:
- Currently Alignment phantom types (e.g. A8 and A16) are not related to
each other: a function (like Data.Vector.SIMD.Algorithms.unsafeXorSSE42)
can have this signature:
unsafeXorSSE42 :: Storable a = SV.Vector
On Sat, Jul 7, 2012 at 9:59 PM, Gábor Lehel illiss...@gmail.com wrote:
class AlignedToAtLeast n a
instance AlignedToAtLeast A1 A1
instance AlignedToAtLeast A4 A1
instance AlignedToAtLeast A4 A4
instance AlignedToAtLeast A8 A1
instance AlignedToAtLeast A8 A4
instance AlignedToAtLeast A8 A8
On Sat, 2012-07-07 at 21:59 +0200, Gábor Lehel wrote:
An alternative solution is to encode all of the alignments in unary,
which is more general; if they're all going to be a power of two you
can store just the logarithm:
data One
data Twice n -- not practical to call it Double :)
class
On Sun, Jul 8, 2012 at 12:21 AM, Nicolas Trangez nico...@incubaid.com wrote:
On Sat, 2012-07-07 at 21:59 +0200, Gábor Lehel wrote:
An alternative solution is to encode all of the alignments in unary,
which is more general; if they're all going to be a power of two you
can store just the
On Sat, 2012-07-07 at 21:13 +0200, Nicolas Trangez wrote:
As you can see, the zipWith Data.Vector.SIMD implementation is slightly
slower than the Data.Vector.Storable based one. I didn't perform much
profiling yet, but I suspect allocation and ForeignPtr creation is to
blame, this seems to be
Ok , thanks for the answers, I understand now what liftM2 does.
In this case would it be silly to use combinerPred (and maybe a newType
Predicate a = a - Bool) for the sake of readability or shoud I stick with
a - Bool and liftM2?
thanks, Sebastián
2012/7/6 Brent Yorgey
On Sun, 2012-07-08 at 01:40 +0200, Gábor Lehel wrote:
unsafeXorSSE42 :: (Storable a,
SV.AlignedToAtLeast SV.A16 o1, SV.Alignment o1,
SV.AlignedToAtLeast SV.A16 o2, SV.Alignment o2,
SV.AlignedToAtLeast SV.A16 o3, SV.Alignment o3) =
SV.Vector o1 a - SV.Vector o2 a -
Venerable Haskell Hackers,
I love Haskell and think it should run everywhere. Now supposing I would
like to build another backend for GHC, perhaps for Java Bytecode, .Net CIL,
or JavaScript, What would be the best way to approach that? I can think of
a few options:
1. Produce External Core with
As to your porting of Haskell to the JVM question; the JVM would be unable
to perform all the optimizations that GHC can do. There is really not much
point in running slow code.
JavaScript is interesting since the JIT compiler gets better all the time.
On Sat, Jul 7, 2012 at 10:02 PM, Jonathan
34 matches
Mail list logo
