there?
Considered, yes. Done, no. Would love to see the results :-). The crew at
OdHac (Roman, Erik, Simon) ensured that the current version handles all of
'base', which is a good start.
See:
Nikolaos Bezirgiannis, Johan Jeuring and Sean Leather. Usage of Generic
Programming on Hackage
On Wed, Jan 30, 2013 at 1:21 PM, Jan Stolarek wrote:
I will be writing a parser in Haskell and I wonder how to approach the
problem.
Utrecht University has a course that covers this, among other things. You
might find the slides and lecture notes useful:
On Fri, Dec 21, 2012 at 9:27 AM, Christopher Howard wrote:
Thank you for your help. An additional question, if I might: For the
sake of elegance and simplicity, I modified the class and instances to
avoid the tuple aspect:
data Socket2 a b = Socket2 a b
instance (Monoid a, Monoid b) =
On Fri, Dec 14, 2012 at 10:47 PM, Ian Lynagh wrote:
On Fri, Dec 14, 2012 at 04:34:29PM -0500, Carter Schonwald wrote:
A related question I have is that I've some code that will map the
singleton Nats to Ints, and last time I looked into this/ had a chat on
the
ghc-users list, it sounded
On Sun, Dec 9, 2012 at 10:39 PM, Ian Lynagh wrote:
Please test as much as possible; bugs are much cheaper if we find them
before the release!
I tried to build the source tarball on Mac OS X 10.5.8. I used GHC 7.6.1,
which I also built myself (without any problem) and installed in
On Thu, Dec 6, 2012 at 1:29 PM, Simon Peyton-Jones wrote:
My own understanding is this:
A GHC *user* is someone who uses GHC, but doesn't care how it is
implemented.
A GHC *developer* is someone who wants to work on GHC itself in some way.
The current mailing lists:
*
On Thu, Dec 6, 2012 at 5:55 PM, Ian Lynagh wrote:
On Thu, Dec 06, 2012 at 06:25:49PM +0200, Roman Cheplyaka wrote:
+1. I'd like to follow GHC development discussions, but getting all the
commits is too much.
I'm surprised by this, FWIW. I think skimming the commits is a good way
to get
On Wed, Nov 21, 2012 at 2:56 PM, Emil Axelsson wrote:
This is one of the problem Syntactic aims to solve, but it requires you to
use a different representation of expressions (for good or bad). If you
want to keep your existing representation, then you have to use a generic
programming
We discovered that GHC and GHCi (7.4.1) accept promoted types without
specifying language extensions (and even when specifying -XHaskell98).
For example, promoted lists are accepted:
Prelude type T = [Int,Char]
Prelude :i T
type T = (:) * Int ((:) * Char ([] *))
-- Defined at interactive:2:6
Hi Daryoush,
Prelude :t 3 2
3 2 :: (Num a, Num (a - t)) = t
What does the type mean in plain english?
It's important to remember that numeric literals are polymorphic. That is,
3 :: Num a = a. They do not have monomorphic types such as Int or Integer.
In the above, GHCi is inferring the
(I'm again starting a new thread to focus on this issue. It's easier to
track that way.)
On Thu, Oct 4, 2012 at 11:40 AM, Simon Peyton-Jones wrote:
There is also the small matter, in this example, of distinguishing which
`_' is which. The description works, but you have to think about it. I
Hi Simon,
Thanks for all your work in getting TypeHoles into HEAD. We really
appreciate it.
I was playing around with HEAD today and wanted to share a few observations.
(1) One of the ideas we had was that a hole `_' would be like `undefined'
but with information about the type and bindings.
On Fri, Sep 14, 2012 at 12:45 PM, Florian Lorenzen wrote:
I'd like to transform a value of an ADT to a GADT. Suppose I have the
simple expression language
data Exp = Lit Int | Succ Exp | IsZero Exp | If Exp Exp Exp
and the GADT
data Term t where TLit :: Int - Term Int TSucc :: Term
On Fri, Sep 14, 2012 at 2:27 PM, Erik Hesselink wrote:
I don't think this is safe. What will happen if you evaluate
typecheck (Lit 1) :: Maybe (Term Bool)
Indeed! Silly me. Caught by the lure again. Thanks.
Regards,
Sean
___
Haskell-Cafe mailing
On Tue, Sep 11, 2012 at 3:39 PM, Corentin Dupontwrote:
@Oleg: Yes the set of events is closed and I would be much happier with a
GADT! But no matter how hard I tried I couldn't manage.
Here is the full problem:
*{-# LANGUAGE ExistentialQuantification, TypeFamilies, DeriveDataTypeable
#-}
On Tue, Sep 11, 2012 at 6:46 PM, David Menendez wrote:
Mixing GADTs and Typeable seems like a bad idea. If you really don't
want to put viewEvent in the Event typeclass, but the class of events
is closed, you could use a GADT to witness the event type.
On Tue, Sep 11, 2012 at 7:03 PM,
On Tue, Sep 11, 2012 at 9:18 PM, Corentin Dupont wrote:
That's very interesting.
One problem is, if the set of event is closed, the set of possible data
types is not (the user can choose any data type for a Message callback for
example). I think this can be solved using a class instead of a
On Tue, Aug 21, 2012 at 5:02 PM, Sergey Mironov wrote:
Hi. Does anybody know anything about Sebastiaan Visser, the maintainer
of Salvia-* packages (web server) ? Looks like his email is dead.
I responded to Sergey off-list, so others don't have to.
Regards,
Sean
Hi Eric (et Café),
On Thu, Jul 5, 2012 at 5:13 PM, Eric Kow wrote:
*[Everybody should write everything in Go?][m7] (28 May)
Ryan Hayes posted a small [snippet of Go][go-snippet] showing how
friendly he found it for writing concurrent programs, “No
pthread... not stupid
On Fri, Jul 6, 2012 at 4:03 PM, Eric Kow wrote:
Subject line makes me wonder how often the digests get caught in people's
spam filters
Oops! Should have removed that part before replying. I think it comes from
the university's mail server, and it's rather obnoxious. I tend to ignore
it.
On Thu, Jun 7, 2012 at 4:59 PM, Ian Lynagh wrote:
On Tue, Jun 05, 2012 at 03:07:09PM +0200, Soenke Hahn wrote:
If not, does that mean,
ghc-7.4.1 does not support OS X 10.5?
As far as I know, if you build GHC 7.4.1 on OS X 10.5 then it will work,
but I haven't tried it so I may be wrong.
Hi wren,
On Tue, Jun 5, 2012 at 7:32 AM, wren ng thornton wrote:
I'm working on creating some distribution bundles of GHC 7.4.1 and HP
2012.2.0.0 for OSX 10.5 to help rectify the lack of support on older Macs.
In building GHC I've run into a linking error in stage1:
ld: duplicate symbol
On Wed, Jun 6, 2012 at 3:22 AM, Bartosz Milewski wrote:
You might have seen a few post by me mentioning FP Complete and asked
yourself the question: Who is this guy and what is FP Complete?
Yes. ;)
I haven't been active in the Haskell community, as I'm a relative newcomer
to Haskell. I am
On Sun, Jun 3, 2012 at 6:24 PM, Mark Lentczner wrote:
We're pleased to announce the next release of Haskell Platform:
a single, standard Haskell distribution for everyone.
Awesome! Congratulations!
Download Haskell Platform 2012.2.0.0:
http://haskell.org/platform/
It's a relatively
Hi Benjamin,
On Fri, Jun 1, 2012 at 9:54 PM, Benjamin Redelings wrote:
I have written an interpreter that operates on the lambda calculus
augmented with letrec, constructors, case, primitive objects, and builtin
operations. I'd like to display the internal state of the intepreter at
On Thu, May 31, 2012 at 6:35 PM, Clark Gaebel wrote:
*X 3^40 `mod` 3 == modexp2 3 40 3
False
*X modexp2 3 40 3
0
*X 3^40 `mod` 3
0
*X 3^40 `mod` 3 :: Int
1
*X 3^40 `mod` 3 :: Integer
0
I'm confused. Last I checked, 0 == 0.
Yes, but 3^40 /= 3^40 when you have arithmetic overflow:
*X
Hi Mathijs,
On Tue, May 22, 2012 at 8:42 AM, Mathijs Kwik wrote:
After using zippers for a while, I wanted to dig a bit deeper into them.
I found there is some relation between Zipper and Comonad, but this
confuses me somewhat.
You might also take a look at:
Comonadic functional attribute
On Tue, May 22, 2012 at 9:34 PM, Artyom Kazak wrote:
http://www.haskell.org/**haskellwiki/Monomorphism_**restrictionhttp://www.haskell.org/haskellwiki/Monomorphism_restriction
+
http://www.haskell.org/ghc/docs/latest/html/users_guide/interactive-evaluation.html#extended-default-rules
Hi Romildo,
On Wed, May 2, 2012 at 3:08 PM, j.romildo wrote:
You are right in the sense that I cannot mix Expr Bool and Expr Double
in a (O op l r) expression.
But the parser should be able to parse any form of expressions. So I
rewrite my program to take this into account.
The new
, April 1.* Our sponsor for the DHD,
Ordina, will use the registration to prepare the (free!) lunch and venue.
If you're coming only to UHac and not the DHD, you can register by April 19.
http://www.haskell.org/haskellwiki/DHD_UHac/Register
See you in Utrecht!
The Organizers:
Sean Leather
, April 1.* Our sponsor for the DHD,
Ordina, will use the registration to prepare the (free!) lunch and venue.
If you're coming only to UHac and not the DHD, you can register by April 19.
http://www.haskell.org/haskellwiki/DHD_UHac/Register
See you in Utrecht!
The Organizers:
Sean Leather
Hi Stephen,
On Mon, Mar 5, 2012 at 08:52, Stephen Tetley wrote:
How do I add type annotations to interior locations in an abstract syntax
tree?
I use an annotated expression tree in my work. The nodes of the AST are
annotated with the type, assumption set, and constraint set as described in
to a new location. Actually, it's the same
location as on Saturday and Sunday, so that should make things easier.
See you in Utrecht!
The Organizers:
Sean Leather
Jurriën Stutterheim
Jurriaan Hage
P.S. Make sure your Monad is also a Functor.
P.P.S. Apologies for multiple copies
to a new location. Actually, it's the same
location as on Saturday and Sunday, so that should make things easier.
See you in Utrecht!
The Organizers:
Sean Leather
Jurriën Stutterheim
Jurriaan Hage
P.S. Make sure your Monad is also a Functor.
P.P.S. Apologies for multiple copies
More:
http://translate.google.com/translate?sl=nltl=enu=http%3A%2F%2Fweb.tue.nl%2Fcursor%2Finternet%2Fjaargang54%2Fcursor11%2Fnieuws%2Findex.php%3Fpage%3Dx34
Background:
http://en.wikipedia.org/wiki/Nicolaas_Govert_de_Bruijn
___
Haskell-Cafe mailing
new project or toy. It doesn't have to be research. It
doesn't even have to be done. Just email Sean Leather (leat...@cs.uu.nl)
with your idea, and we'll talk about it.
Also, the wiki has been updated with a lot more information since that last
announcement. We'll continue to add more. Let us know
new project or toy. It doesn't have to be research. It
doesn't even have to be done. Just email Sean Leather (leat...@cs.uu.nl)
with your idea, and we'll talk about it.
Also, the wiki has been updated with a lot more information since that last
announcement. We'll continue to add more. Let us know
Hi Yusaku,
On Tue, Feb 7, 2012 at 00:27, HASHIMOTO, Yusaku wrote:
Hi, I wrote a simple shell function for switching GHC version on the
system. It works only under Mac OSX, and only switch GHCs installed
via .pkg installers. It's useful to experiment newer features without
worrying breaking
On Tue, Jan 24, 2012 at 10:21, Anupam Jain wrote:
Are there any haskellers in Delhi or nearby areas interested in a
meetup? I've been dabbling in Haskell for a long time
I'm not in India, but I am curious about the use of Haskell or other FP
languages for teaching/research there. Do you (or
On Thu, Jan 19, 2012 at 23:21, Dan Doel wrote:
A is a retract of B.
http://nlab.mathforge.org/nlab/show/retract
g is the section, f is the rectraction. You seem to have it already.
The definition needn't be biased toward one of the functions.
Great! That's what I was looking for.
I have two types A and B, and I want to express that the composition of two
functions f :: B - A and g :: A - B gives me the identity idA = f . g ::
A - A. I don't need g . f :: B - B to be the identity on B, so I want a
weaker statement than isomorphism.
I understand that:
(1) If I look at it
On Wed, Jan 11, 2012 at 03:23, Conal Elliott wrote:
Is the standard pair-with-monoid monad instance in some standard place? I
see the Applicative instance in Control.Applicative, and the
pair-with-monoid Functor instance in Control.Monad.Instances, and the (-)
e and Either e monad instances
of the community
of enthusiastic Haskell hackers from around the world. It will start
immediately following the DHD and continue to Sunday, April 22.
= Call for Speakers =
We are looking for speakers for the Dutch HUG Day. If you have something
interesting to share, please email Sean Leather (leat
of the community
of enthusiastic Haskell hackers from around the world. It will start
immediately following the DHD and continue to Sunday, April 22.
= Call for Speakers =
We are looking for speakers for the Dutch HUG Day. If you have something
interesting to share, please email Sean Leather (leat
We're currently looking into so-called expression holes in GHC -- like the
type goals of Agda -- and we've run into a problem of understanding.
We have defined an expression, call it __ for now, for which we want to
find the type after a program is type-checked. In tcExpr (TcExpr.lhs), we
can see
On Thu, Dec 22, 2011 at 16:19, Brandon Allbery wrote:
On Thu, Dec 22, 2011 at 05:44, Conor McBride wrote:
under Leopard, and got this far
bash-3.2$ sudo ./configure
Password:
checking for path to top of build tree... dyld: unknown required load
command 0x8022
configure: error:
On Thu, Dec 22, 2011 at 22:25, Conor McBride wrote:
On 22 Dec 2011, at 16:08, Sean Leather wrote:
I've built it from source (ghc-7.4.0.20111219-src.tar.**bz2) on Leopard.
I'd be happy to contribute my build if somebody tells me what to do.
I had a crack at this and got quite warm
On Thu, Dec 15, 2011 at 11:07, Niklas Broberg wrote:
Envisioned: The function you ask for can definitely be written for
haskell-src-exts, which I know you are currently using. I just need to
complete my type checker for haskell-src-exts first. Which is not a small
task, but one that has been
On Mon, Dec 5, 2011 at 00:18, Bartosz Wójcik wrote:
If Munich and 200 km circle do not provide with any offer, perhaps you may
know
what is available in Europe, limiting language of study to [German,
English,
Polish]?
I believe the following recent thread will help answer this question:
(Sent on behalf of Doaitse Swierstra)
Despite some last minute changes to the planning we are happy to announce
that the next Dutch functional programming day will take place on January
6, 2012, at the university campus De Uithof of Utrecht University.
In case you want to give a presentation
Do you know of any tutorial or slides from a talk on one of the
pretty-printing libraries? It could be on Text.PrettyPrint.HughesPJ or
uulib or any other, similar library.
I'm thinking of developing slides for a course, and I'm looking for sources
of inspiration.
Regards,
Sean
(Sent on behalf of Doaitse Swierstra)
Despite some last minute changes to the planning we are happy to announce
that the next Dutch functional programming day will take place on January
6, 2012, at the university campus De Uithof of Utrecht University.
In case you want to give a presentation
What is the language of the talks and the participants? English or Dutch?
In past years the language of the talks has always been English. Also,
most Dutch people speak English pretty well, I think.
Yes, what Erik said. Also, even though previous years' websites (below)
have been in Dutch,
On Tue, Nov 8, 2011 at 15:31, Daniel Fischer wrote:
Often this is because they compiled their programme without optimisations,
simply recompiling with -O or -O2 yields a decently performing programme.
So I wonder, should ghc compile with -O1 by default?
What would be the downsides?
Hi Timo,
Now I look for Universities, which offer compiler construction, since
I need that course, preferably in the UK, Ireland, Australia or New
Zealand.
Ideally it would be in Haskell of course.
I currently work in a research group that is well known for their compiler
construction
On Sun, Oct 30, 2011 at 04:02, Gregory Crosswhite wrote:
So is there any difference between the interpretation of MonadPlus and
Alternative, or is the only difference between them that the former applies
to Monad whereas the latter applies to Applicative?
Somewhat OT, but this led me to
Hi Han,
On Fri, Oct 28, 2011 at 09:06, Han Joosten wrote:
I am planning to give a workshop on FP using Haskell. The audience will be
programmers with quite a bit of experience with conventional languages like
Java and .net . I want to give them some feeling about FP. And hopefully,
they will
It seems like :kind is broken in the HEAD ghci:
*Main :kind Maybe
Top level:
Expecting an ordinary type, but found a type of kind * - *
In a type expected by the context: Maybe
*Main
Simon, could this be related to your change for :kind! ?
Regards,
Sean
After many years, I have once again attempted to build GHC from source. The
experience went much easier than in the past.
This time, my system is running the now-old 10.5 (Leopard) using Xcode
3.1.4. I'm probably the only one who wants to build on 10.5, but I still
appreciate the fact that GHC
On Wed, Oct 12, 2011 at 12:35, Yves Parès wrote:
I re-head recently about Google Knol, which is IMO some crossing-over
between a wiki and a blog.
Are there some people that use it here to write haskell-related articles
instead of a regular blog?
As far as anybody outside Google knows, Knol
Hi Benjamin,
My question is, roughly, is there already an existing framework for
incremental evaluation in Haskell?
We at Utrecht have done some work on this:
http://people.cs.uu.nl/andres/Incrementalization/
Simply put, if your computation is a fold/catamorphism, then you can easily
take
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
using immutability only for performance reasons? In that case,
it's not a fundamental difference.
Regards,
Sean
Sent from my iPad
On Sep 23, 2011, at 5:33 AM, Sean Leather leat...@cs.uu.nl wrote:
Hi Edward,
On Thu, Sep 22, 2011 at 16:50, Edward Kmett wrote:
I have a stable-maps package
Hi Simon,
*TF :kind F Int
F Int :: *
*TF :kind! F Int
F Int :: *
= Bool
Does this also work with plain ol' type synonyms? I just noticed that the
:t undefined :: T trick doesn't seem to work with type synonyms.
Thanks,
Sean
Hi Edward,
On Thu, Sep 22, 2011 at 16:50, Edward Kmett wrote:
I have a stable-maps package that provides lookup and inserting into a
map via stable names.
The paper mentions the need for a mutable finite map, and all the operations
are IO. Do you know why this is and what's different with
There is an abstract type called SNMap for stable names referred to in [1].
This has apparently disappeared from GHC a long time ago. Is it still
available somewhere, or is there a suitable replacement for it?
Regards,
Sean
[1] Stretching the storage manager: weak pointers and stable names in
On Wed, Sep 21, 2011 at 04:00, Brent Yorgey wrote:
On Tue, Sep 20, 2011 at 04:29:21PM -0700, J. Garrett Morris wrote:
On Tue, Sep 20, 2011 at 3:44 PM, Simon Peyton-Jones wrote:
What should the GHCi command be *called*?
:simplify or :simplifytype. In GHCi at the moment, you could
I would like to ask GHCi for the type that a type expression will evaluate
to, once all definitions of type synonyms and (when possible) type families
have been inlined.
It appears that I can do some part of this for type T by using :t undefined
:: T:
type family F a
type instance F Int = Bool
On Wed, Sep 14, 2011 at 17:31, Ivan Lazar Miljenovic wrote:
On 15 September 2011 01:24, Sean Leather wrote:
On Wed, Sep 14, 2011 at 05:03, Kazu Yamamoto wrote:
I would like to have an efficient implementation of the chop function.
[...]
Are there any more efficient
On Wed, Sep 14, 2011 at 05:03, Kazu Yamamoto wrote:
I would like to have an efficient implementation of the chop function.
[...]
Are there any more efficient implementations of chop? Any suggestions?
chop xs = go xs id
where
go _ = id
go (c:cs) ss |
On Sun, Sep 4, 2011 at 13:03, Roman Cheplyaka wrote:
* Sean Leather [2011-09-04 12:48:38+0200]
On Sun, Sep 4, 2011 at 12:31, Roman Cheplyaka wrote:
I'm looking for an example of idiomatic usage of the fixpoint
library[1].
[1]: http://hackage.haskell.org/package/fixpoint-0.1.1
On Sun, Sep 4, 2011 at 12:31, Roman Cheplyaka wrote:
I'm looking for an example of idiomatic usage of the fixpoint library[1].
[1]: http://hackage.haskell.org/package/fixpoint-0.1.1
I'm not sure if this counts for idiomatic usage, but you can check out
our approach to incrementalization.
On Wed, Jul 27, 2011 at 05:55, Tom Murphy wrote:
This may sound ignorant because, well, it is ignorant: I know very
little about the underlying mechanics here.
Installing the Haskell Platform currently requires XCode developer tools.
To get XCode on my 10.6 machine, I...
... will check
On Fri, Jul 22, 2011 at 12:00, Pasqualino Titto Assini wrote:
Enter Quid2 http://quid2.org [1]: the half baked, barely tested, totally
unsafe and spectacularly unoptimised Haskell in the Cloud system.
Challenging...
https://plus.google.com/104222093009939197511/posts/MpgUUayq78o
Sean
On Fri, Jun 10, 2011 at 03:15, Manuel M T Chakravarty wrote:
Ian Lynagh:
On Mon, Jun 06, 2011 at 03:47:57PM +0100, Malcolm Wallace wrote:
On 6 Jun 2011, at 13:49, Lyndon Maydwell wrote:
I would be fantastic if XCode wasn't a dependency. ...
Not to detract at all from the work of the
On Mon, Jun 6, 2011 at 16:47, Malcolm Wallace wrote:
The ghc team already bundle a copy of gcc in their Windows distribution,
precisely because it can be fiddly to get a working copy of gcc for that
platform otherwise. I wonder if they would consider the possibility of
shipping gcc on Mac
On Mon, Jun 6, 2011 at 16:47, Malcolm Wallace wrote:
The ghc team already bundle a copy of gcc in their Windows distribution,
precisely because it can be fiddly to get a working copy of gcc for that
platform otherwise. I wonder if they would consider the possibility of
shipping gcc on Mac
Hi Gregory,
I had a similar experience on the scala-user list some time ago. I found
most of the responses to my questions to be rather unproductive and
superficial. I love the haskell-cafe community for their helpfulness and
analytical approach.
I left scala-user not long afterward partly
Prelude let h x y = (g 0 (f x y))
How to do pointfree definition of h?
See the thread http://thread.gmane.org/gmane.comp.lang.haskell.cafe/70488for
related material.
Regards,
Sean
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I just refactored my type and transform system prototype (introduced in [1]
but changed since then) from using mtlx [2] (type-indexed monad transformers
described in [3]) to mtl using RWST. mtlx allowed me to cleanly separate the
various monadic components in a convenient way. Unfortunately, I
On Fri, Mar 18, 2011 at 13:35, JP Moresmau wrote:
These are GHC types, but here is a self-contained example:
{-# LANGUAGE MultiParamTypeClasses, FunctionalDependencies,
FlexibleInstances #-}
data Id=Id String
data Result id =ResultId Id
| ResultGen id
data Sig id=IdSig Id
|
On Tue, Mar 1, 2011 at 11:09, Christian Maeder wrote:
Why are you talking about a 7.2.1 release [...]?
What important achievement (apart from the tickets listed) should I expect
from a 7.2.1 release compared to 7.0.2 (or 7.0.3)?
2011/2/9 Simon Peyton-Jones:
Friends
Just a heads-up. Pedro is working on implementing Generic Defaults, as
described in his Haskell Symposium 2010 paper
www.dreixel.net/research/pdf/gdmh_nocolor.pdf
It will replace (and improve on) the Derivable type classes stuff in GHC
at the moment,
I have been attempting to translate something I did using UUAG into monadic
code. It involved inherited, synthesized, and chained attributes. It has
been said that such attributes correspond to the Reader, Writer, and State
monads, respectively [1]. The former and latter are straightforward, but
Phil:
I wanted to check whether Haskell offers reasonably easy object oriented
programming
It depends on what you're looking for, but in general, you won't find the
same thing you may be used to in native OO languages.
1. OOHaskell doesn't seem to be available in the HackageDB (cabal) -- so
I've been reviewing the library, and have come unstuck with the *id*function.
What's its purpose and can someone give me an example of its practical use.
It's purpose is simply to be the identity function. The type says exactly
what it does.
Prelude :t id
id :: a - a
It's often useful in
On Thu, Dec 2, 2010 at 05:16, Robert Clausecker wrote:
How can I install GHC 7 parallel to GHC 6.12 with the option to choose?
My OS is GNU/Linux, my Distro is Ubuntu (Lucid).
I created this for my Ubuntu VM: https://github.com/spl/multi-ghc
Regards,
Sean
This may be a silly, but I occasionally run into a situation where I'm
wondering what the effective precedence of if then else is. I was finally
motivated to do a few experiments, and it seems like the precedence level is
reset (below 0) after if, then, and else.
λ if not $ False then here else x
Hi Mulhern,
I would like to teach a small section on polytypism/genericity in the
functional programming using Haskell course I'm teaching. I won't, though,
unless I can assign an actual programming exercise in polytypic programming,
however brief. Can anybody recommend a functioning compiler
Don Stewart:
tomahawkins:
A few years ago I attempted to build a Haskell hardware compiler
(Haskell - Verilog) based on the Yhc frontent. At the time I was
trying to overcome several problems [1] with implementing a hardware
description language as a light eDSL, which convinced me a
On Tue, Sep 14, 2010 at 10:24, Kevin Jardine wrote:
I have a set of wrapper newtypes that are always of the same format:
newtype MyType = MyType Obj deriving (A,B,C,D)
where Obj, A, B, C, and D are always the same. Only MyType varies.
A, B, C, and D are automagically derived by GHC using
On Thu, Sep 9, 2010 at 17:44, Eric Y. Kow wrote:
On Thu, Sep 09, 2010 at 17:38:40 +0200, S. Doaitse Swierstra wrote:
I am in my yearly fightto get a working combination of operating
system (Snow Leopard), compiler version (6.12) , wxWidgets and
wxHaskell on my Mac . After deleting most of
On Sat, Aug 28, 2010 at 01:29, Vo Minh Thu wrote:
It would be interesting to know some other sources: [...] number of
attendees to e.g. Utrecht
summer school on FP, ...
Just a bit over 30, I think. And it was interesting to see a significant
number of non-student participants. Perhaps around
Can anyone point me towards existing work I could use? Open course
material and syllabuses I could use, with the necessary references?
At Utrecht University:
- http://www.cs.uu.nl/wiki/FP - for first-year bachelors
- http://www.cs.uu.nl/wiki/Afp - for first-year masters
-
Yitzchak Gale wrote:
Sean Leather wrote:
Which one do you use for strings in HTML or XML in which UTF-8 has become
the commonly accepted standard encoding?
UTF-8 is only becoming the standard for non-CJK languages.
We are told by members of our community in CJK countries
that UTF-8
Johan Tibell wrote:
Here's a rule of thumb: If you have binary data, use Data.ByteString. If
you have text, use Data.Text. Those libraries have benchmarks and have been
well tuned by experienced Haskelleres and should be the fastest and most
memory compact in most cases. There are still a few
On Fri, Aug 6, 2010 at 12:12 AM, Tony Morris wrote:
Hello, does anyone happen to have the lambdacats page cached? The domain (
arcanux.org) and server have disappeared and the wayback machine doesn't
have the images.
On Fri, Aug 6, 2010 at 18:43, John Van Enk wrote:
I happened to download
Simon cat and Oleg cat are also missing, unfortunately.
Also the 'catamorphism' picture with the banana peel (there may be others I
can't recall, too).
Well, I found what I could...
http://spl.smugmug.com/Humor/Lambdacats/13227630_eKt46#960831913_rhDdG
I just saw a lot of spam posts to the GHC Trac. Is there any way to prevent
future occurrences of this?
Sean
___
Glasgow-haskell-bugs mailing list
Glasgow-haskell-bugs@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
On Fri, Jul 9, 2010 at 16:23, Steve Schafer wrote:
On Fri, 09 Jul 2010 10:07:06 -0400, brandon s. allbery wrote:
I don't think I've ever seen them *followed* by commas. Preceded,
always.
In American English, they're always followed by commas, and preceded by
comma, semicolon, dash or left
1 - 100 of 280 matches
Mail list logo
