#5523: Mistake in error messages for importing infix constructors
--+-
Reporter: ivanm | Owner:
Type: bug | Status: closed
Priority: normal|
#5514: bad variable escape analysis when TypeFamilies are enabled
-+--
Reporter: dmwit | Owner:
Type: bug | Status: closed
#5518: Some unicode symbols are not allow in literal characters or strings
---+
Reporter: ertai |Owner:
Type: bug | Status: infoneeded
Priority: normal
#5515: panic! (the 'impossible' happened) with evil self-referential instance
--+-
Reporter: andersk | Owner:
Type: bug |
#5513: panic! (the 'impossible' happened) on ‘deriving instance lowercase_name
a’
---+
Reporter: andersk | Owner:
Type: bug | Status:
#5508: Template Haskell -ddump-splices lambda pretty printing bug
+---
Reporter: mgsloan1 | Owner:
Type: bug| Status:
#5516: Universally quantified GADT context leads to overlapping instance
+---
Reporter: andersk| Owner:
Type: bug| Status: closed
#3897: reading a large String as Double takes too long
+---
Reporter: maeder |Owner:
Type: bug | Status: new
Priority: normal |
#3897: reading a large String as Double takes too long
-+--
Reporter: maeder|Owner:
Type: bug | Status: new
#5204: request better error message for malformed quasiquoted declaration
---+
Reporter: nr| Owner:
Type: feature request | Status: closed
#5518: Some unicode symbols are not allow in literal characters or strings
---+
Reporter: ertai |Owner:
Type: bug | Status: infoneeded
Priority: normal
#5501: randomR overflow
--+-
Reporter: daniel.is.fischer| Owner: rrnewton
Type: bug | Status: closed
Priority: normal
#5524: Unnecessary overflow in encodeFloat
--+-
Reporter: daniel.is.fischer | Owner: daniel.is.fischer
Type: bug| Status: new
Priority: normal
GHC Users,
I would like to make to the following two proposals:
* Eliminate the default grouping close from SQL-like comprehensions
* Introduce a GHC extension for list literal overloading
OK, let me start with the first proposal.
Currently, the SQL-like comprehension notation (both in its
What are the defaulting rules for IsList? It needs to be backwards compatible.
-- Lennart (iPhone)
On Sep 30, 2011, at 19:28, George Giorgidze giorgi...@gmail.com wrote:
GHC Users,
I would like to make to the following two proposals:
* Eliminate the default grouping close from
--
First Call for Papers
Special Issue of Mathematical Structures in Computer Science (MSCS) on
TERM and GRAPH Rewriting
--
Scope
VSTTE 2012 Verification Competition
---
A software verification competition is organized on behalf of the
VSTTE 2012 conference (https://sites.google.com/site/vstte2012).
The purposes of this competition are: to help promote approaches and
tools, to provide new
I'm not convinced there are enough use cases to warrant the extra complexity.
-- Lennart (iPhone)
On Sep 30, 2011, at 14:21, Christian Maeder christian.mae...@dfki.de wrote:
Hi,
the following sections are currently legal in Haskell:
(a + b +) and (++ a ++ b)
because + is left and
Anton Tayanovskyy wrote:
John Meacham's frisby library [1] did something similar, though the
technique is not as well-known as it should be.
Looks like an excellent library, thank you!
Note that you don't need to give explicit names to your rules anymore, the
monad can do that for you.
I
Paulo Pocinho poci...@gmail.com wrote:
I don't know if this is a bad habit, but I had already separated the
dialogue text in the code with variables holding the respective
strings. At this time, I thought there could be some other way than
gettext. Then I figured how to import localisation
I'm trying to use Happy for the first time, and I'm having trouble with this
very simple example:
= BEGIN: PolyParser.y =
{
module Main where
import Char ( isAlpha, isDigit, isSpace )
}
%name calc
%tokentype { Token }
%error { parseError }
%token
id { TokenId $$ }
On Thu, Sep 29, 2011 at 7:54 PM, Paulo Pocinho poci...@gmail.com wrote:
Still uncomfortable with i18n, I learned about the article I18N in
Haskell in yesod blog [4]. I'd like to hear more about it.
Yesod's approach is pretty nice [1]. The idea is to have a data type
with all your messages,
Would it be useful/worthwhile to have type/data family instances show up in
Haddock just as type class instances do?
Regards,
Sean
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
since there is no Haskell compiler/interpreter for JVM yet (considering
LambdaVM outdated), then the question for kind of Haskell replacement on
this platform is either CAL[1] or Frege[2]. I'd like to ask here those
who have used either of those languages for your experience with
2011/9/30 John Lask jvl...@hotmail.com:
On 30/09/2011 7:15 AM, Sergey Mironov wrote:
Hello. I am reading Programming with Arrows by John Hughes (very
helpful and interesting!), the book has an exercises requiring a
module called Circuits for checking the answer. There should be things
like
I often use SciTE for editing Haskell code. I wanted an easy way to type symbols
such as ∀ (instead of forall), so I created a properties file that allows me
to do that. I haven't seen anything similar online (I Googled first), so I made
the code available online.
You can find the file and
Hello. How can I find which installed package a specified module belongs
to? ghci or cabal or ghc-pkg?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Friday 30 September 2011, 21:04:48, Roman Beslik wrote:
Hello. How can I find which installed package a specified module belongs
to? ghci or cabal or ghc-pkg?
$ ghc-pkg find-module Foo.Bar.Baz
___
Haskell-Cafe mailing list
On Thu, Sep 29, 2011 at 3:54 PM, Paulo Pocinho poci...@gmail.com wrote:
Hello list.
I've been trying to figure a nice method to provide localisation. An
The grammatical framework excels at translation and localization -- it
probably has the highest learning curve of the options; but it will
On Fri, Sep 30, 2011 at 5:44 PM, Rogan Creswick cresw...@gmail.com wrote:
The grammatical framework excels at translation and localization -- it
probably has the highest learning curve of the options; but it will
generate the best / most accurate text depending on the target
language:
*
You can use Data.Sequence.fromList to go [a] - Seq a, though.
So given
f :: Monad m = a - m b
you have
import Data.Traversable as T
import Data.Sequence as S
g :: Monad m = [a] - m (S.Seq b)
g = T.mapM f . S.fromList
- ryan
On Wed, Sep 28, 2011 at 6:20 PM, Marc Ziegert co...@gmx.de wrote:
On Fri, Sep 30, 2011 at 2:09 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
On Fri, Sep 30, 2011 at 5:44 PM, Rogan Creswick cresw...@gmail.com wrote:
The grammatical framework excels at translation and localization -- it
probably has the highest learning curve of the options; but it
Hi All,
I am trying to run a Haskell program compiled on my Ubuntu box on a server
box that does not have GHC installed and where I dont have root privileges.
I run into several missing libraries, in particular libgmp, libffi and
libuuid (the later two are needed by my program). How I can
33 matches
Mail list logo