#4430: Better support for resolving infix expressions in template haskell
-+--
Reporter: reinerp |Owner: igloo
Type: feature request | Status: patch
Priority: normal
#5285: Core lint error in T3001-2 [7.0 regression]
-+--
Reporter: simonmar |Owner: simonpj
Type: bug | Status: new
Priority: highest
#4459: Polymorphic Data.Dynamic
-+--
Reporter: vivian|Owner: vivian
Type: feature request | Status: new
Priority: normal
#5285: Core lint error in T3001-2 [7.0 regression]
-+--
Reporter: simonmar |Owner: simonpj
Type: bug | Status: new
Priority: highest
#4903: Inliner looping when specialising across modules (with GADTs and other
extensions)
-+--
Reporter: dreixel | Owner: simonpj
Type: bug |
#4903: Inliner looping when specialising across modules (with GADTs and other
extensions)
-+--
Reporter: dreixel | Owner: simonpj
Type: bug |
#5336: Annotations aren't working
-+--
Reporter: simonmar |Owner:
Type: bug | Status: new
Priority: highest |Milestone: 7.2.1
#4430: Better support for resolving infix expressions in template haskell
-+--
Reporter: reinerp |Owner: igloo
Type: feature request | Status: patch
Priority: normal
#5333: Arrow command combinators and infixr cause the desugarer to fail
--+-
Reporter: peteg |Owner:
Type: bug| Status: new
#5337: mkRtsOptionsLevelObj should respect -optc standard headers
---+
Reporter: gnezdo | Owner:
Type: bug | Status: new
Priority: normal |
#4295: Review higher-rank and impredicative types
-+--
Reporter: simonpj |Owner: simonpj
Type: bug | Status: new
Priority: normal|
#5290: Add UNPACK support to Template Haskell
---+
Reporter: mikhail.vorozhtsov |Owner:
Type: feature request | Status: merge
Priority: high|
#5333: Arrow command combinators and infixr cause the desugarer to fail
--+-
Reporter: peteg |Owner: ross
Type: bug| Status: new
#5293: Linker error from integer-gmp (OS X 10.7)
---+
Reporter: jhenahan|Owner:
Type: bug | Status: new
Priority: highest
#3372: Allow for multiple linker instances
-+--
Reporter: jcpetruzza|Owner:
Type: feature request | Status: new
Priority: normal|Milestone:
You point is that the (C Int) dictionary has (C String) as a superclass, and (C
String) has (C Int) as a superclass. So the two instances are mutually
recursive, but that's ok.
That is not unreasonable. But it is dangerous. Consider
class C [a] = C a
Then any dictionary for (C a) would
*Simon Peyton-Jones* simonpj at microsoft.com
glasgow-haskell-users%40haskell.org?Subject=Re%3A%20Superclass%20Cycle%20via%20Associated%20TypeIn-Reply-To=%3C59543203684B2244980D7E4057D5FBC125661A72%40DB3EX14MBXC308.europe.corp.microsoft.com%3E
--
You point is that the
Hello,
I am pleased to announce the release of two new libraries: boomerang
and web-routes-boomerang.
boomerang is a library for general purpose, invertible parsing and
pretty printing. It provides combinators which allow you to specify a
grammar once and automatically extract a parser and
Am 21.07.2011 20:45, schrieb Jeremy Shaw:
Hello,
I am pleased to announce the release of two new libraries: boomerang
and web-routes-boomerang.
Does this have anything to do with:
Boomerang: A bidirectional programming language for ad-hoc data
http://www.seas.upenn.edu/~harmony/
?
If not,
Welcome to issue 191 of the HWN, a newsletter covering developments in
the Haskell community. This release covers the week of July 10 to
16, 2011.
[1] http://haskell.org/
You can find the HTML (and mobile) version of the issue at:
For the following expression, I would consider a True result a false positive:
let x = x :: Int in x == x
Dean
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Greetings Haskell community,
I stuck with a space leak problem in simple task. I have a function
described with a list of pairs:
type Fn a b = [(a, b)]
mapping values from a to b. And I have a composition operation which accepts
two functions and returns
theirs composition:
compose :: Eq
On Wed, 20 Jul 2011 12:48:48 -0300
Thiago Negri evoh...@gmail.com wrote:
Is it possible to implement (==) that first check these thunks before
evaluating it? (Considering both arguments has pure types).
E.g.,
Equivalent thunks, evaluates to True, does not need to evaluate its
On 07/21/2011 10:30 AM, Pedro Vasconcelos wrote:
On Wed, 20 Jul 2011 12:48:48 -0300
Thiago Negrievoh...@gmail.com wrote:
Is it possible to implement (==) that first check these thunks before
evaluating it? (Considering both arguments has pure types).
E.g.,
Equivalent thunks, evaluates to
Hi cafe!
I feel a bit like I'm speaking out of turn for bringing this up -- and
I'm sure it must have been brought up many times before -- but I hope
there can be something fruitful had from a discussion.
In my travels I've read several people with much better grasp of Haskell
than I have
On 21 July 2011 11:10, Arlen Cuss cel...@sairyx.org wrote:
Hi cafe!
I feel a bit like I'm speaking out of turn for bringing this up -- and
I'm sure it must have been brought up many times before -- but I hope
there can be something fruitful had from a discussion.
In my travels I've read
On Thu, Jul 21, 2011 at 1:22 AM, Olexander Kozlov ookoz...@gmail.com wrote:
Greetings Haskell community,
I stuck with a space leak problem in simple task. I have a function
described with a list of pairs:
type Fn a b = [(a, b)]
mapping values from a to b. And I have a composition operation
Any examples for hangups of 'smartEq' are greatly appreciated, I couldn't
produce any so far.
Following sequences will hang smartEq. They are both infinite and aperiodic.
smartEq (fromList primes) (fromList primes)
smartEq (fromList pidigits) (fromList pidigits)
On 07/21/2011 02:15 PM, Alexey Khudyakov wrote:
Any examples for hangups of 'smartEq' are greatly appreciated, I couldn't
produce any so far.
Following sequences will hang smartEq. They are both infinite and aperiodic.
smartEq (fromList primes) (fromList primes)
smartEq (fromList pidigits)
On Thu, Jul 21, 2011 at 8:31 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Well, for fmap vs liftM, you have that liftM is automatically defined
for you rather than needing to make the Functor instance, so if you're
quickly defining a Monad for internal use then you can just use
Hi, Cafe,
My wife, a biologist, will attend a conference outside Helsinki in
mid-September. I've decided to accompany her on the trip to Finland.
Are there any Haskellers in the area who might be interested in an
informal meetup?
I'd also welcome any suggestions on what to see, do, eat,
Hello,
I have binary tree, with every leaf tuple - (k,v):
data Tree k v = EmptyTree
| Node (k, v) (Tree k v) (Tree k v)
How can i make Show Instance for (Tree Int Int) ?
I try:
instance Show (Tree k v) where
show EmptyTree = show Empty
show (Node (Int, Int) left
Hi.
On 07/21/2011 04:45 PM, Александр wrote:
Hello,
I have binary tree, with every leaf tuple - (k,v):
data Tree k v = EmptyTree
| Node (k, v) (Tree k v) (Tree k v)
How can i make Show Instance for (Tree Int Int) ?
The easiest way is automatic derivation:
data Tree k v = EmptyTree
|
Hello, thank you for reply. I know that i can derive this. But i want to know
how can i make it by hand.
Thank you.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
The documentation for the Show typeclass has this very example:
http://hackage.haskell.org/packages/archive/base/latest/doc/html/Prelude.html#t:Show
The summary? you need to define either showPrec or show, the latter of which is
simpler, it is just a - String.
So:
instance Show (Tree Int Int)
Hi,
I think your main problem here is that you use Int in the pattern matching.
The point is that you are matching your value of type Tree k v to a pattern
such as:
- EmptyTree
- (Node (a, b) left right)
Patterns don't contain type information such as Int, but things like value
constructors and
Hello, Willem Van Lint, Thank you for help, it works.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
I am pleased to announce the release of two new libraries: boomerang
and web-routes-boomerang.
boomerang is a library for general purpose, invertible parsing and
pretty printing. It provides combinators which allow you to specify a
grammar once and automatically extract a parser and
Am 21.07.2011 20:45, schrieb Jeremy Shaw:
Hello,
I am pleased to announce the release of two new libraries: boomerang
and web-routes-boomerang.
Does this have anything to do with:
Boomerang: A bidirectional programming language for ad-hoc data
http://www.seas.upenn.edu/~harmony/
?
If not,
I'm new to Haskell and am trying to use the SAX module to parse an XML
file. I'm using the following code:
module FPHParser where
import Data.Text as Text
import Data.Maybe
import Text.XML.LibXML.SAX as SAX
import System.IO
f :: IO (Parser IO)
f =
do
let g = do
Nope. It is not related.
It is also not related to the GSM library:
http://www.programmersheaven.com/download/29760/download.aspx
or the decompiler:
http://boomerang.sourceforge.net/index.php
Perhaps picking an original name would have been a wise choice. But it
was the only I idea I had :)
Am 21.07.2011 21:19, schrieb Jeremy Shaw:
Nope. It is not related.
It is also not related to the GSM library:
http://www.programmersheaven.com/download/29760/download.aspx
or the decompiler:
http://boomerang.sourceforge.net/index.php
Perhaps picking an original name would have been a wise
Hi Everybody,
I'm having some strange issues with Network.CGI's pathInfo action, or else
some other strangeness with pattern matching.
My mainCGI CGI action is:
mainCGI :: CGI CGIResult
mainCGI = pathInfo = outputSlotTHtml . packagesPage
outputSlotTHtml is irrelevant to my problem.
Welcome to issue 191 of the HWN, a newsletter covering developments in
the Haskell community. This release covers the week of July 10 to
16, 2011.
[1] http://haskell.org/
You can find the HTML (and mobile) version of the issue at:
I've now started uploading the fruits of this labour. Unfortunately I
still don't have access to the ArchHaskell areas on kiwilight, so if
you want to try this out you have to modify your pacman config:
[h4a]
Server = http://www.kiwilight.com/~magnus/$repo/$arch
The x86_64 repo has been fully
45 matches
Mail list logo
