#810: GHC complains about missing instance in conjunction with GADTs
--+-
Reporter: [EMAIL PROTECTED] | Owner: simonpj
Type: bug | Status: closed
Priority: normal
#973: Adding Arbitrary instance for Either
--+-
Reporter: guest | Owner:
Type: proposal | Status: new
Priority: normal | Milestone:
#973: Adding Arbitrary instance for Either
---+
Reporter: guest | Owner:
Type: proposal | Status: new
Priority: normal | Milestone:
#960: Lexical call site string
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
Component:
#973: Adding Arbitrary instance for Either
---+
Reporter: guest | Owner:
Type: proposal | Status: closed
Priority: normal | Milestone:
#974: Add isLeft, isRight, fromLeft, fromRight, and splitEithers to Data.Either
---+
Reporter: guest | Owner:
Type: proposal| Status: new
Priority: normal
Hi
#974: Add isLeft, isRight, fromLeft, fromRight, and splitEithers to Data.Either
Woohoo! Finally!
This proposal would add basic functionality to `Either` similar to that
for `Maybe`. The `splitEithers` function of type `[Either a b] -
([a],[b])` is unique; however, it seems to be a
#959: Debugging info(?) leaks out: Urk! Inventing strangely-kinded void TyCon
-+--
Reporter: igloo| Owner:
Type: bug | Status: new
Priority:
#932: Improve inlining
--+-
Reporter: simonpj | Owner:
Type: task | Status: new
Priority: normal| Milestone: 6.6.1
Component: Compiler |Version: 6.4.2
#960: Lexical call site string
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
Component:
#960: Lexical call site string
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
Component:
#975: Allow quoting of the file path in :load command
---+
Reporter: [EMAIL PROTECTED] | Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
#975: Allow quoting of the file path in :load command
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
| as you may remember, in GHC survey awkward error messages was named as
| one of most serious GHC drawbacks. i propose to start collecting
| examples of bad error messages together with what we want to see in
| these cases. as first contribution, i've added this text as
|
| There was some discussion on the haskell' list about bring back
| record puns, which were once in ghc.
|
| Record punning would have been very helpful on one of my recent
| projects, where I had some large arrays of statically initialized
| records.
| The
On Oct 30, 2006, at 8:47 AM, Deborah Goldsmith wrote:
Since the files are not in the distribution itself, they can hardly
be installed. :-) It looks like the Mac OS X Intel distribution has
a problem. I'll check the PPC distribution later to see if it has
the same problem.
I checked and
On Oct 23, 2006, at 8:59 AM, Björn Buckwalter wrote:
On 10/19/06, Simon Marlow [EMAIL PROTECTED] wrote:
See this page that I just created:
http://hackage.haskell.org/trac/ghc/wiki/Building/MacOSX
I tried these instructions, first by using my existing (darwinports)
readline in /opt/local,
On Mon, Oct 30, 2006 at 12:11:23PM -, Simon Peyton-Jones wrote:
I always thought it was a mistake to remove record puns in H98. I would
not be against re-introducing them into GHC, since they appear to remain
in Hugs and are in Yhc.
yes. jhc has them too and I wish ghc did.
puns like Foo
On Mon, 30 Oct 2006 16:30:42 -0800
John Meacham [EMAIL PROTECTED] wrote:
On Mon, Oct 30, 2006 at 12:11:23PM -, Simon Peyton-Jones wrote:
I always thought it was a mistake to remove record puns in H98. I would
not be against re-introducing them into GHC, since they appear to remain
in
Hi
puns like Foo { .. } would be great too.
I'd vote for enabling them with a command line switch, rather than by default,
as they can be confusing to folks learning the language.
How discussions come full circle :) I started this discussion on the
Hugs users list because I want to
On 10/30/06, Frederik Eaton [EMAIL PROTECTED] wrote:
On Sun, Oct 29, 2006 at 10:03:32PM -0400, Samuel Bronson wrote:
On 10/25/06, Frederik Eaton [EMAIL PROTECTED] wrote:
http://hackage.haskell.org/trac/ghc/wiki/PackageMounting
It looks nice, but don't you think the -package-base flag ought
Frederik Eaton [EMAIL PROTECTED] writes:
It looks nice, but don't you think the -package-base flag ought to
take both the package name *and* the mountpoint?
My intention was that -package-base specifies a base for the package
specified in the preceding -package flag [...]
In other words, it
What about packages with multiple module trees like, say, Cabal?
That's a good question, and I think the right answer is not to do
anything special to support them. I assume that what you're referring
to with Cabal is that there is no common prefix for all of the module
names, but rather a small
| http://hackage.haskell.org/trac/ghc/wiki/PackageMounting
|
| It looks nice, but don't you think the -package-base flag ought to
| take both the package name *and* the mountpoint?
|
| Otherwise, this looks like what I've wanted all along, if only I knew
it ;-).
I think most of you know
UNIVERSITY OF OXFORD
Software Engineering Programme
Kellogg College
THREE UNIVERSITY LECTURERSHIPS IN SOFTWARE ENGINEERING
Applications are invited for three new University Lecturerships in Software
Engineering. The successful applicants will join the staff of the
University's Software
Simon Peyton-Jones wrote:
| http://hackage.haskell.org/trac/ghc/wiki/PackageMounting
|
| It looks nice, but don't you think the -package-base flag ought to
| take both the package name *and* the mountpoint?
|
| Otherwise, this looks like what I've wanted all along, if only I knew
it
Dear Haskell Folks
This is to announce the availability of indexed data types, a modest
extension of our earlier proposal for associated data types[1], in GHC's
development version. Detailed information on where to get the right GHC
and how to use indexed types is available from the Haskell
---
Haskell Weekly News
http://haskell.org/haskellwiki/HWN
Issue 47 - October 31, 2006
---
Welcome to issue 47 of HWN, a weekly newsletter covering
On 2006-10-26, Jon Fairbairn [EMAIL PROTECTED] wrote:
On 2006-10-25 at 20:57- Aaron Denney wrote:
On 2006-10-25, Jon Fairbairn [EMAIL PROTECTED] wrote:
No. A small alteration to the lexical syntax for the sake of
improved readability seems perfectly justifiable as long as
it doesn't
lambda-abstraction doesn't even exist at expression level, but is
replaced by spliced matching; application exists, but is not needed,
because (f e) = {| e | {| f |} |} (unless I'm mistaken?)
oops, wrong brackets around f - should be:
{| e | ^f^ |} -- {| ^f e^ |} -- f e
with f supposedly
Funny that you should mention this idea. I spent last night and this
morning implementing it in ghc. But I use '..' instead of '*'.
The punning is available both for expressions and patterns.
I am of two minds about this extension. It introduces bound
variables without mentioning the
name:
introduce lambda-match (explicit match failure and fall-through)
Dear All,
may I be so optimistic as to interpret the absolute lack of counter
arguments over the last week as indication that this proposal is
acceptable in general? Thanks to those few who have expressed
support so
[EMAIL PROTECTED] (Donald Bruce Stewart) writes:
But we could do with more information on:
[...]
How to make cabal projects into distribution-specific (.deb, .rpm, and
so on) packages?
-k
--
If I haven't seen further, it is by standing in the footprints of giants
It's a pity that groupBy isn't defined a little differently:
-- @'groupBy' rel xs@ returns the shortest list of lists such that
--
-- * the concatenation of the lists is @xs@, and
--
-- * @rel@ is 'True' for each consecutive pair of elements in a sublist.
--
groupBy :: (a - a -
On 29.10 19:56, John Meacham wrote:
Since DrIFT can only understand haskell source code, it can't derive
instances for anything you don't have the original source to. such as
things in the pre-compiled libraries that come with ghc. you will likely
have to write out those instances by hand.
Ketil Malde wrote:
How to make cabal projects into distribution-specific (.deb, .rpm, and
so on) packages?
The answer for .debs is: ask a Debian developer (or a prospective
developer) to package it for you.
The reason is that to make a good .deb, one needs to be familiar with a lot
of
On Mon, Oct 30, 2006 at 09:54:08AM +0100, Ketil Malde wrote:
How to make cabal projects into distribution-specific (.deb, .rpm, and
so on) packages?
for slackware you can have a look to this slackBuild script:
http://gorgias.mine.nu/repos/slackBuild/hxt/hxt/hxt.SlackBuild
regards,
andrea
On 30/10/06, Tony Morris [EMAIL PROTECTED] wrote:
4) If you want links to base libraries in your haddock output, do such
and such (how do you do that anyway?)
I believe you need a local copy of the library sources, whose path you
give to haddock with some flag.
--
-David House, [EMAIL
Hello Tony,
Monday, October 30, 2006, 6:22:31 AM, you wrote:
My suggestion:
The steps of reasoning as you start with a blank directory.
For example:
great idea! i'm sure that such sort of manual will be very helpful for
anyone starting his first haskell project
--
Best regards,
Bulat
I'm trying to create a simple parser for the GADT evaluator from the
wobbly types paper, and I need a little help. Here's the GADT and the
evaluator...
data Term a where
Lit :: Int - Term Int
Inc :: Term Int - Term Int
IsZ :: Term Int - Term Bool
If :: Term Bool -
On 10/28/06, Tomasz Zielonka [EMAIL PROTECTED] wrote:
On Fri, Oct 27, 2006 at 06:28:58AM -0700, Chad Scherrer wrote:
Should I expect a monadic version to take a performance hit? What if I
use some SPECIALIZE pragmas or somesuch? Is it more efficient to write
one from scratch, or do specific
On Monday 30 October 2006 22:18, Einar Karttunen wrote:
On 29.10 19:56, John Meacham wrote:
Since DrIFT can only understand haskell source code, it can't derive
instances for anything you don't have the original source to.
Ahhh, ok.
such as
things in the pre-compiled libraries that
Hello.
I have some html from which I want to extract records.
Each record is represented within a number of tr nodes, and all records tr
nodes are contained by the same parent node.
The things I've tried so far end up giving me the cartesian product of record
fields, so for the html fragment
On Tue, Oct 31, 2006 at 07:46:05AM +1300, Daniel McAllansmith wrote:
Hmmm, seems strange that it can successfully derive for the Data.Maybe type
but not the Data.Word32 type. I didn't think it would have access to any
original source from my ghc install, there only seems to be hi files.
It
I don't have an answer, but would be extremely interested in knowing
one!
one of my first attempts to use GADTs was to do something similar,
implemening the simple polymorphic lambda calculus in a way that
transformations could be guarenteed typesafe statically, but then when I
went and tried to
Hi Greg,
We've built some GADT parsers recently to fit our two-level
transformation library with front-ends for for XML Schema and SQL.
See Coupled Schema Transformation and Data Conversion For XML and
SQL (PADL 2007) if you're interested. The trick is to use a
constructor in which the a
Just noticed Joost Visser's message but since I
had (essentially a very similar) response I thought I might
send it off as well ... It includes the conditional cases.
Regards,
-d
{-# OPTIONS_GHC -fglasgow-exts #-}
module Main where
data Term a where
Lit :: Int - Term Int
Inc ::
I can't get searchAll5[1] in Yet Another Haskell Tutorial to run. Ghci
complains that it can't find a MonadPlus that satisfies the required
type; it needs a MonadPlus.
I suspect this is due to the use of 'mzero' and 'mplus', without making
StateT a MonadPlus. My thought for this was to push
Disclaimer: I've never read through YAHT, so I don't know if I'm
missing any context...
Your intuition was correct: you do want to lift the MonadPlus property
through the StateT transformer. This is the key to the transformer
libraries, each transformer both contributes a computational feature
49 matches
Mail list logo
