Sorry for that, but
Am Donnerstag, dem 06.10.2022 um 14:28 +0200 schrieb Joachim Breitner:
> To nominate yourself, please send an email to me (as the committee
> secretary) at m...@joachim-breitner.de until February 11th.
>
should be October 16th.
Cheers,
Joachim
--
Joachim Bre
deliberations private.
On behalf of the committee,
Joachim Breitner
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell
!
Cheers,
Joachim
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell
!
Cheers,
Joachim
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/glasgow-haskell-users
Hi,
Am Freitag, dem 08.04.2022 um 16:58 +0200 schrieb Joachim Breitner:
> what might make eqType go False that is _not_ visible in the pretty-
> printed view?
I have a hunch: `(%,%) a b` differs from `(,) a b`, but both are
pretty-printed as (a, b)`… I’ll shout if that wasn’t it.
might make eqType go False that is _not_ visible in the pretty-
printed view?
Cheers,
Joachim
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
to choose
someone who turns out to be unable to serve.)
On behalf of the committee,
Joachim Breitner
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi
turns out to be unable to serve.)
On behalf of the committee,
Joachim Breitner
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo
who turns out to be unable to serve.)
On behalf of the committee,
Joachim Breitner
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
signature.asc
Description: This is a digitally signed message part
___
Haskell mailing
and are
not published in the conference proceedings.
Program Committee
-
* Edwin Brady (University of St. Andrews, UK)
* Joachim Breitner – chair (DFINITY / University of Pennsylvania)
* Ben Gamari (Well-Typed LLP)
* Michael Hanus (Kiel University)
* Roman Leshchinsky (Facebook)
* Niki
and are
not published in the conference proceedings.
Program Committee
-
* Edwin Brady (University of St. Andrews, UK)
* Joachim Breitner – chair (DFINITY / University of Pennsylvania)
* Ben Gamari (Well-Typed LLP)
* Michael Hanus (Kiel University)
* Roman Leshchinsky (Facebook)
* Niki
-in-progress project, a problem to intrigue and perplex
Haskell implementors, or simply to ask for feedback and collaborators.
Program Committee
-
* Edwin Brady (University of St. Andrews, UK)
* Joachim Breitner – chair (University of Pennsylvania)
* Ben Gamari (Well-Typed LLP
-in-progress project, a problem to intrigue and perplex
Haskell implementors, or simply to ask for feedback and collaborators.
Program Committee
-
* Edwin Brady (University of St. Andrews, UK)
* Joachim Breitner – chair (University of Pennsylvania)
* Ben Gamari (Well-Typed LLP
turns out to be unable to serve.)
On behalf of the committee,
Joachim Breitner
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
signature.asc
Description: This is a digitally signed message part
___
Haskell mailing list
, a work-in-progress project, a problem to intrigue and perplex
Haskell implementors, or simply to ask for feedback and collaborators.
Program Committee
-
* Edwin Brady (University of St. Andrews, UK)
* Joachim Breitner – chair (University of Pennsylvania)
* Ben Gamari (Well-Typed LLP
, a work-in-progress project, a problem to intrigue and perplex
Haskell implementors, or simply to ask for feedback and collaborators.
Program Committee
-
* Edwin Brady (University of St. Andrews, UK)
* Joachim Breitner – chair (University of Pennsylvania)
* Ben Gamari (Well-Typed LLP
dropped in the process, which is
also good :-)).
Cheers,
Joachim
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
signature.asc
Description: This is a digitally signed message part
___
Glasgow-haskell-users mailing l
talks are to present a single
idea, a work-in-progress project, a problem to intrigue and perplex
Haskell implementors, or simply to ask for feedback and collaborators.
Program Committee
-
* Edwin Brady (University of St. Andrews, UK)
* Joachim Breitner – chair (University
t
peculiar needs, it’s not too big. (Although highlights in CoreLint
output would be useful for all of use.)
Thanks for your input,
Joachim
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
signature.asc
Description: This
e other options that I might not see right now?
Cheers,
Joachim
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
signature.asc
Description: This is a digitally signed message part
___
Glasgow-haskell-users maili
Hi,
I had some funky idea where a type checker plugin would have to
synthesize code for a custom-solved instances on the fly. But it seems
that does not work because EvTerm is less expressive than Core
(especially, no lambdas):
Hi,
Am Dienstag, den 16.01.2018, 11:08 -0500 schrieb Joachim Breitner:
> in a GHC plugin, I want to synthesize simple data structures, and
> insert them into the code. What is the most idiomatic way of writing a
> function, say,
>
> foo :: Maybe String -> CoreExpr
>
>
Hi,
in a GHC plugin, I want to synthesize simple data structures, and
insert them into the code. What is the most idiomatic way of writing a
function, say,
foo :: Maybe String -> CoreExpr
or
foo :: Maybe String -> CoreM CoreExpr
so that the resulting CoreExpr describes the input.
in http://incredible.pm/ but that was a much simpler
setting than a complex typed language like Core.
Implementing some form of higher-order pattern matching might actually
be doable, but would it be reliable? When does it become undecidable?
Joachim
--
Joachim Breitner
m...@joachi
Hi,
I’d like to use Annotations to transport some meta-information from the
Haskell source to GHC Plugins (as they are meant to be, right?).
But I am struggling expressing annotations that relate different
symbols. Here are some hypthetical examples what I want to express:
foo :: String ->
zation function”
that checks the output for a certain property, e.g. by grepping for
certain patterns.
The only real unit tests that I know of are these:
http://git.haskell.org/ghc.git/tree/HEAD:/testsuite/tests/callarity/unittest
These are effectively programs using “GHC-the-library”
Joachim
--
Joach
ntain and extend, and I thought that dictionary
> synthesis from rewrite rules might be one.
>
> Regards,
> -- Conal
>
> On Tue, Oct 3, 2017 at 8:49 AM, Joachim Breitner <m...@joachim-breitner.de>
> wrote:
> > Hi,
> >
> > Now that I think about it: You
; Regards, - Conal
>
> On Tue, Oct 3, 2017 at 7:52 AM, Joachim Breitner <m...@joachim-breitner.de>
> wrote:
> > Hi,
> >
> >
> > Am Montag, den 02.10.2017, 17:03 -0700 schrieb Conal Elliott:
> > > My questions:
> > >
> > > *
tion. (Or maybe TH can
create such rules?)
If this idiom turns out to be useful, I wonder if there is a case for
-rules specified in type classes that get instantiated upon every
instance, e.g.
class C k where
comp' :: k b c -> k a b -> k a c
{-# RULES &qu
gt;
> -- • Could not deduce (D k b) arising from a use of ‘addC’
> -- from the context: D (->) b
>
> -- Why does GHC infer the (C k) constraint for the first rule but not (D k b)
> -- for the second rule?
>
> ___
> Glasgow-haskell-
Hi,
author of ghc-heap-view here.
Am Mittwoch, den 30.08.2017, 18:34 +0300 schrieb Yitzchak Gale:
> Getting ghc-vis to compile looks hopeless, for a number of reasons.
> The dependencies on gtk and cairo are huge.
Is that really a problem?
> It hasn't been updated
> on Hackage for a year and
c/wiki/DefaultSuperclassInstances
I am not sure what the status is, and how actively it is pushed for. It
is certainly compelling.
Joachim
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
signature.asc
Description: This is a digitally signed messag
Well, thanks for the constructive feedback everyone :-)
Joachim
--
Joachim Breitner
m...@joachim-breitner.de
http://www.joachim-breitner.de/
signature.asc
Description: This is a digitally signed message part
___
Haskell-prime mailing list
Haskel
19.05.2017, 17:35 -0400 schrieb Mario Blažević:
> On 2017-05-16 10:18 AM, Joachim Breitner wrote:
> > Hi,
> >
> > a very small proposal to be considered for Haskell':
>
> I like it, but it should probably be a GHC proposal first. I
> don't
> think Haskel
Hi,
a very small proposal to be considered for Haskell':
Currently, the report states
An abbreviated form of module, consisting only of the module body,
is permitted. If this is used, the header is assumed to be ‘module
Main(main) where’.
I propose to change that to
An
Hi,
a common pattern is
x `elem` [a,b,c]
or
x `elem` "/!#"
instead of
x == a || x == b || x == c
or
x == '/' || x == '!' || x == '#'.
This used to be also what hlint suggested, although that hint was
removed https://github.com/ndmitchell/hlint/issues/31.
Upon closer inspection it seems
Hi Ranjit,
Am Dienstag, den 24.01.2017, 16:09 -0800 schrieb Ranjit Jhala:
> My goal is to write a function
>
> tyconString :: TyCon -> String
>
> (perhaps with extra parameters) such that given the
> `TyCon` corresponding to `Set`, I get back the "original"
> name `S.Set`, or even
Hi,
Am Freitag, den 13.01.2017, 20:27 +1100 schrieb Erik de Castro Lopo:
> Michael Snoyman wrote:
>
> > Could be I'm misunderstanding, but are you looking for -ddump-rule-
> > firings?
>
> Wasn't aware of that, but my question was a little more general.
>
> If I write a library that includes
Hi,
just responding to this one aspect:
Am Sonntag, den 08.01.2017, 21:16 -0500 schrieb David Feuer:
> but using defaults for
> the others would give poor implementations. To cover this case, I
> think it would be nice to add per-method GND-deriving syntax. This
> could look something like
>
>
Hi,
looking at Haskell prime’s trac, I noticed that there is no formal
proposal to include InstaceSigs¹ in the next language revision.
As a teacher who uses live coding in a text editor, I usually write out
all type signatures. Not being able to do that for instance methods is
a minor annoyance.
. HAL is cheap, and even cheaper for
students, and yet cheaper if you pay by the early registration deadline
of August 15¹
Also check out the other two conferences of LDEC (WLP and WLFP), and if
you like them, make it a week full of functional programming!
Thanks,
Joachim Breitner
on behalf
Hi,
Am Montag, den 11.07.2016, 08:31 +0200 schrieb Sven Panne:
> Because at first glance, this is visually only a tiny fraction away
> from
>
> (if c then f else g) it d them a elsa b
>
> which would be parsed in a totally different way. (Personally, I
> think that if/then/else is useless
Hi,
Am Freitag, den 08.07.2016, 13:09 +0200 schrieb Sven Panne:
> I don't think so: https://ghc.haskell.org/trac/ghc/wiki/ArgumentDo#Bl
> ockasaLHS explicit states that
>
> do f &&& g
> x
>
> parses as
>
> (f &&& g) x
Correct
> , so
>
> foobar
> do f &&& g
> x
>
>
Hi,
Am Freitag, den 08.07.2016, 11:32 +0200 schrieb Sven Panne:
> 2016-07-08 9:09 GMT+02:00 Joachim Breitner <m...@joachim-breitner.de>:
> > Am Freitag, den 08.07.2016, 08:35 +0200 schrieb Sven Panne:
> > > foobar
> > > do f &&& g
> >
Hi,
Am Freitag, den 08.07.2016, 08:35 +0200 schrieb Sven Panne:
> foobar
> do f &&& g
> x
>
> Should the x now be an argument of foobar (as it is currently) or the
> "do"? If it is not an argument of the "do", suddenly things get very
> context-dependent. Computers are good at
Hi,
Am Donnerstag, den 07.07.2016, 13:15 -0400 schrieb Carter Schonwald:
> agreed -1,
> ambiguity is bad for humans, not just parsers.
>
> perhaps most damningly,
> > f do{ x } do { y }
>
> is just reallly really weird/confusing to me,
It is weird to me, but in no way confusing under the
, Chalmers and Gothenburg University, Sweden
* Heinrich Apfelmus, Leipzig, Germany
* Joachim Breitner, Karlsruhe Institute of Technology, Germany (Chair)
* Matthias Fischmann, Zerobuzz, Germany
* Petra Hofstedt, BTU Cottbus-Senftenberg, Germany
* Wolfgang Jeltsch, Institute of Cybernetics at Tallinn
15, 2016.
== Program committee ==
* Andreas Abel, Chalmers and Gothenburg University, Sweden
* Heinrich Apfelmus, Leipzig, Germany
* Joachim Breitner, Karlsruhe Institute of Technology, Germany (Chair)
* Matthias Fischmann, Zerobuzz, Germany
* Petra Hofstedt, BTU Cottbus-Senftenberg, Germany
Hi,
Am Samstag, den 11.06.2016, 12:12 -0700 schrieb Michael Burge:
> What do you think?
For the module header, this is already possible.
For the term language, it unfortunately clashes with things like
TupleSections.
I believe this has been discussed a few times in the past, e.g.
* Heinrich Apfelmus, Leipzig, Germany
* Joachim Breitner, Karlsruhe Institute of Technology, Germany (Chair)
* Matthias Fischmann, Zerobuzz, Germany
* Petra Hofstedt, BTU Cottbus-Senftenberg, Germany
* Wolfgang Jeltsch, Institute of Cybernetics at Tallinn University of
Technology, Estonia
, 2016.
== Program committee ==
* Andreas Abel, Chalmers and Gothenburg University, Sweden
* Heinrich Apfelmus, Leipzig, Germany
* Joachim Breitner, Karlsruhe Institute of Technology, Germany (Chair)
* Matthias Fischmann, Zerobuzz, Germany
* Petra Hofstedt, BTU Cottbus-Senftenberg, Germany
[Deliberately restricting my reply to one mailing list. Cross-posting
is usually not required.]
Hi,
Am Sonntag, den 14.02.2016, 19:51 +0100 schrieb Sven Panne:
> As stated on the Wiki, stuff in -Wcompat will often be non-
> actionable,
you omitted the important “if backwards compatibility is
Hi,
Am Mittwoch, den 09.12.2015, 06:51 -0700 schrieb Jeremy:
> "fix" is hyperlinked to itself, and it doesn't say what the fix is
> for.
that is intended. fix is inherent self-referential, and furthermore
polymorphic.
Greetings,
Joachim
PS: SCNR
--
Joachim “nomeata” Breitner
Hi,
Am Samstag, den 24.10.2015, 13:14 -0700 schrieb Evan Laforge:
> WRT the "bound at" bits in "relevant bindings", I have no strong
> opinion. What about omitting them if they are in the same file as
> the main error? Or maybe they always are? I'm not totally clear how
> it chooses which
Hi,
Am Sonntag, den 25.10.2015, 21:30 +0100 schrieb MigMit:
> Doesn't seem worth it to me. Current format is quite parseable, and
> not really bad for human eyes either.
I know that you meant this as a litote, but let me ignore that I know
that for a moment to reply, that “not really bad” is
Hi,
Am Samstag, den 24.10.2015, 10:08 +0100 schrieb Malcolm Wallace:
> On 24 Oct 2015, at 09:17, Joachim Breitner wrote:
>
> > For example in
> >
> > > Relevant bindings include
> > > syllables :: [(a1, Syllable)]
> > > (
Hi,
thanks for starting this discussion, and I agree with your suggestion.
Maybe we can brainstorm some more fine refinements.
Given that our error message are on the rather verbose side, maybe
there is detail that can be omitted.
For example in
> Relevant bindings include
> syllables
Hi,
Am Dienstag, den 14.04.2015, 21:54 +0200 schrieb Michal Terepeta:
On Mon, Apr 13, 2015 at 10:34 PM, Christiaan Baaij
christiaan.ba...@gmail.com wrote:
Actually, I meant only with -fno-specialise.
Done. Helps quite a bit but CallArity is still a pretty expensive.
I’m on that, and I
Dear Lars,
Am Dienstag, den 25.11.2014, 10:36 +0100 schrieb Lars Hupel:
The invocation is similar to this:
ghc -c -outputdir $OUT -XTrustworthy Library.hs
ghc -c -outputdir $OUT -i$OUT -XSafe $SUBMISSION
ghc -c -outputdir $OUT -i$OUT Test_Suite.hs
ghc-outputdir $OUT -i$OUT -o
Hi,
Am Samstag, den 18.10.2014, 11:02 -0700 schrieb htebalaka:
I guess my central point is I don't see how anyone can benefit from the
current behaviour. For instance, a simple real world example:
import Prelude
import Data.Text.Lazy.IO (putStrLn)
I find this quite convincing. If I bother
Hi,
in Debian, we have the (well-known) problem of linking against libraries
using libgmp, in this case haskell-curl, which links against libcurl,
which links against gnutls, which uses libgmp since the latest release:
https://lists.debian.org/debian-haskell/2014/07/msg0.html
Are there any
Hi,
for those of you who don’t follow Planet Haskell and haven’t seen my
blog post¹ on it:
I have created a (very) small library list-fusion-probe with an identity
function
fuseThis :: [a] - [a]
that will complain loudly (at run-time, for the time being) if the
argument is not
Hi,
Am Dienstag, den 01.04.2014, 10:25 + schrieb Simon Peyton Jones:
Joachim Breitner has set up Travis-CI. (I don't know exactly what
that is, but it sounds useful.)
Travis is a free cloud service that runs arbitrary tests (in our case, a
stripped version of validate) upon pushes to git
Hi,
Am Sonntag, den 16.03.2014, 13:56 +0100 schrieb Merijn Verstraaten:
Cons:
GHC would have to either maintain a possibly long of variants to look
for ([.hs, .lhs, .rst.lhs, .md.lhs, .svg.lhs, .docx.lhs]),
or look for Foo.*.lhs.
I’d find the latter acceptable, but it should be noted.
Hi,
armhf still fails like in RC1:
https://buildd.debian.org/status/fetch.php?pkg=ghcarch=armhfver=7.8.20140228-1stamp=1394723755
[..]
0% ( 0 / 5) in 'WwLib'
0% ( 0 / 2) in 'DmdAnal'
0% ( 0 / 2) in 'WorkWrap'
compiler/typecheck/TcSplice.lhs-boot:29:1:
TcSplice.tcTopSpliceExpr
with unregisterised via-C compilation then
we can probably fix it. Could you open a ticket (or point me to the
existing ticket if there is one)?
Cheers,
Simon
On 05/03/2014 21:54, Joachim Breitner wrote:
Hi,
sparc fails differently than in RC1, and very plainly
Hi,
armel still fails like in RC1:
https://buildd.debian.org/status/fetch.php?pkg=ghcarch=armelver=7.8.20140228-1stamp=1394495564
inplace/bin/ghc-stage2 -o utils/haddock/dist/build/tmp/haddock ...
/«PKGBUILDDIR»/compiler/stage2/build/libHSghc-7.8.0.20140228.a(genSym.o): In
function `genSym':
Hi,
sparc fails differently than in RC1, and very plainly with a
segmentation fault in dll-split (which happens to be the first program
to be run that is compiled with stage1):
https://buildd.debian.org/status/fetch.php?pkg=ghcarch=sparcver=7.8.20140228-1stamp=1393975264
Any ideas? Anyone
Hi,
building RC2 right now, and the failures have changed. Reporting as the
come in:
Am Donnerstag, den 06.02.2014, 13:36 + schrieb Joachim Breitner:
mips
(https://buildd.debian.org/status/fetch.php?pkg=ghcarch=mipsver=7.8.20140130-1stamp=1391631539)
mipsel
(https://buildd.debian.org
Hi,
Am Mittwoch, den 19.02.2014, 11:13 +0100 schrieb Herbert Valerio Riedel:
On 2014-02-18 at 23:22:13 +0100, Joachim Breitner wrote:
Am Dienstag, den 18.02.2014, 14:12 -0800 schrieb David Fox:
It seems to me that the stm library that is supposed to be built into
ghc-7.8.1 is missing
Hi David,
Am Dienstag, den 18.02.2014, 14:12 -0800 schrieb David Fox:
It seems to me that the stm library that is supposed to be built into
ghc-7.8.1 is missing. The deb provides and conflicts with
libghc-stm-dev , but does not provide libghc-stm-dev-2.4.2.1-abcde.
this seems to be the
Hi,
Am Sonntag, den 09.02.2014, 14:37 -0600 schrieb Austin Seipp:
There is one caveat, if I remember correctly: if a package uses
TemplateHaskell, it must declare it as such in the Cabal file. This is
because Cabal does not parse the source to detect if TemplateHaskell
is needed in the
to Debian experimental, so that these problems are found closer to their
cause. Or hope for the builders network resurrection.
Greetings,
Joachim
--
Joachim Breitner
e-Mail: m...@joachim-breitner.de
Homepage: http://www.joachim-breitner.de
Jabber-ID: nome...@joachim-breitner.de
signature.asc
Hi,
with RC1 in experimental, the Debian auto-builders have now picked up
building 7.8, and it is failing on armel, hurd-i386, mips and mipsel:
armel
(https://buildd.debian.org/status/fetch.php?pkg=ghcarch=armelver=7.8.20140130-1stamp=1391666879)
inplace/bin/ghc-stage2 -o
,
Joachim
--
Joachim Breitner
e-Mail: m...@joachim-breitner.de
Homepage: http://www.joachim-breitner.de
Jabber-ID: nome...@joachim-breitner.de
signature.asc
Description: This is a digitally signed message part
___
Glasgow-haskell-users mailing
Hi,
Am Dienstag, den 04.02.2014, 09:52 +0900 schrieb Jens Petersen:
Am Montag, den 03.02.2014, 19:49 +0900 schrieb Jens Petersen:
Hi, I did a test build [1] of the current ghc-7.8 branch for
Fedora 21
devel, which I think should also install to Fedora 20.
Hi,
Am Dienstag, den 04.02.2014, 09:03 + schrieb Joachim Breitner:
Am Dienstag, den 04.02.2014, 09:52 +0900 schrieb Jens Petersen:
Am Montag, den 03.02.2014, 19:49 +0900 schrieb Jens Petersen:
Hi, I did a test build [1] of the current ghc-7.8 branch
Dear Jens,
Am Montag, den 03.02.2014, 19:49 +0900 schrieb Jens Petersen:
Hi, I did a test build [1] of the current ghc-7.8 branch for Fedora 21
devel,
which I think should also install to Fedora 20.
I’m surprised that it worked for you. Did not you not hit
Hi,
heh, I wanted to throw in the same argument: If its just more elaborate
error messages, why do we need a flag for it? So count that as +1 from
me.
Greetings,
Joachim
Am Dienstag, den 14.01.2014, 11:12 -0600 schrieb Austin Seipp:
I'm actually more in favor of Richard's proposal of just
Hi,
Am Sonntag, den 13.10.2013, 17:50 +0200 schrieb Michael Snoyman:
I wanted to announce that FP Complete is now running a Jenkins job to
build Stackage with GHC 7.8. You can see the current results in the
relevant Github issue[1]. Essentially, we're still trying to get
version bounds
Hi,
Am Montag, den 14.10.2013, 15:34 +0200 schrieb Vlatko Basic:
Looks like we're missing the point here. I did add the PPAs, and all
is OK for me. :-)
LTS is a stable release, and yet many other apps get updated regulary,
but GHC does not. GHC is not part of the system itself, it's just an
Hi,
Am Mittwoch, den 09.10.2013, 23:18 -0400 schrieb Richard Eisenberg:
On Oct 9, 2013, at 6:24 PM, Joachim Breitner m...@joachim-breitner.de wrote:
So the conclusion is indeed: Let type class constraints have a nominal
role, and all is fine.
But, then it would seem that any class
Hi,
Am Mittwoch, den 09.10.2013, 15:21 -0400 schrieb Richard Eisenberg:
Wait! I have an idea!
The way I've been describing GND all along has been an abbreviation.
GHC does not coerce a dictionary from, say, Ord Int to Ord Age.
Instead, GHC mints a fresh dictionary for Ord Age where all the
Hi,
not sure if this is not old news to you all, but I think that for this
discussion, it helps to consider these two aspects of a class instance
separately:
(1) An instance is a record of functions
(2) An instance is a function of sorts¹ from types to (1)
and clearly, type parameters of (1)
Hi,
I’ll be visiting Madrid next week (research visit) and I’m wondering if
there are any Haskell or FP Group meeting or other events that might be
interesting? I could possibly contribute a talk. (Both preferably in
English.)
Wednesday or Thursday evening might would most convenient.
Hi,
Am Mittwoch, den 04.09.2013, 14:46 +0200 schrieb Adam Bergmark:
You might be interested in these two comment threads (and maybe the
rest of the comments as well):
http://www.reddit.com/r/haskell/comments/1ldqav/thoughts_on_uhc_vs_haste_vs_fay/cbyrhwz
Good morning,
Am Samstag, den 27.07.2013, 20:16 + schrieb Simon Peyton-Jones:
So the change I propose to make IncoherentInstances to pick
arbitrarily among instances that match. More precisely, when trying
to find an instance matching a target constraint (C tys),
a) Find all instances
Hi,
Am Montag, den 19.08.2013, 08:27 + schrieb Simon Peyton-Jones:
Yes that makes sense to me. Please do document the reasoning of this thread
(and the example you give) in a Note [Incoherent instances] somewhere
though!
done, patches ready for review and merge at
Hi,
now that roles are in HEAD, I could play around a bit with it. They were
introduced to solve the unsoundness of newtype deriving, but there is
also the problem of abstraction: If I define a set type based on an ord
instance, e.g.
data Set a = Set a -- RHS here just for demonstration
Hi,
not sure – where would injectivity be needed?
Greetings,
Joachim
Am Sonntag, den 18.08.2013, 15:00 -0500 schrieb Nicolas Frisby:
Is the non-injectivity not an issue here because the type family
application gets immediately simplified?
On Sun, Aug 18, 2013 at 12:45 PM, Joachim Breitner
Hi,
for some reason I was under the impression that if I don’t export the
methods of a class, then no user of my module can create instances. But
I was wrong and in fact they can; the methods will just all be bound to
error
Is there really no way to create a class so that no-one else can
Hi,
Am Samstag, den 17.08.2013, 20:34 +0200 schrieb Bas van Dijk:
I used the following in the past:
module M (PublicClass(..)) where
class HiddenClass a
class HiddenClass a = PublicClass a where
...
...
Now users of M can't declare instances of PublicClass because they
don't
Hi,
Am Samstag, den 17.08.2013, 11:11 +0200 schrieb Christopher Done:
inv reverse (take 10)
if you want that fast and lazy, check out
http://www.joachim-breitner.de/blog/archives/600-On-taking-the-last-n-elements-of-a-list.html
Greetings,
Joachim
--
Joachim “nomeata” Breitner
Hi,
Am Samstag, den 10.08.2013, 10:49 +0200 schrieb Henning Thielemann:
Recently I found that links from Google search results to archive
Haskell-Cafe messages are invalid. The messages are still there, but got
a different number. E.g. the search result says:
Hi,
Am Montag, den 12.08.2013, 14:52 +0200 schrieb Sven Panne:
2013/8/12 Joachim Breitner m...@joachim-breitner.de:
happens with mailman/pipermail occasionally.
o_O That's news to me... Why/how does this happen? This sounds like a
serious bug to me, the URLs should really, really be stable
Hi,
Am Montag, den 29.07.2013, 16:19 +0100 schrieb John Lato:
+1 to the original proposal and Edward's suggestion of emitting a
warning. I've occasionally wanted this behavior from
IncoherentInstances as well.
+1 for the proposal, -1 for the warning: It is a feature, not a bug, at
least
Hi,
Am Mittwoch, den 24.07.2013, 01:41 -0700 schrieb Michael Sloan:
Another non-answer is to take a look at using vaccum[0] and
vaccum-graphviz[1] together, to get an idea of the heap structure of
unforced values. I've made a gist demonstrating how to use these to
visualize the heap without
Hi,
Am Freitag, den 19.07.2013, 11:19 +0200 schrieb John Blackbox:
The question about generating the code was only to have a debugging
tool - to see if the generated AST is good - I wanted to generate the
Haskell code only to check if its correct, but normally I would not do
it, because it
Hi,
small update: I generalized the code at
https://github.com/nomeata/nt-coerce/blob/9349dd3/GHC/NT/Plugin.hs
a bit, it is now able to handle to create NT-values for unwarpping
arbitrary newtypes and for lifting across type constructors. It does so
unconditionally, i.e. does _not_ yet check
Hi,
Am Dienstag, den 02.07.2013, 16:28 + schrieb Simon Peyton-Jones:
| I also noticed a problem with my logic for creating the NT-lifting
| function. Suppose
| data C a = MkC (Foo a)
| Just having the constructors of C in scope is not sufficient
| to safely provide
| NT a b -
1 - 100 of 487 matches
Mail list logo
