-art.org
Workshop Organization
Brent Yorgey (general chair)
Donya Quick (program chair)
Tom Murphy (performance chair)
Program Committee
=
Heinrich Apfelmus (self-employed)
Chuck Jee Chau (Hong Kong University of Science and Technology, Hong Kong)
Brian Heim
- Nicolas Oury, Jane Street, UK
- Jennifer Paykin, University of Pennsylvania, US
- Paula Severi, University of Leicester, UK
- Tarmo Uustalu, Tallinn University of Technology, Estonia
- Jeremy Yallop, University of Cambridge, UK
- Brent Yorgey, Hendrix College, US (co-chair)
# Proceedings
of Pennsylvania, US
- Paula Severi, University of Leicester, UK
- Tarmo Uustalu, Tallinn University of Technology, Estonia
- Jeremy Yallop, University of Cambridge, UK
- Brent Yorgey, Hendrix College, US (co-chair)
# Proceedings and Copyright
We plan to have formal proceedings, published
of Pennsylvania, US
- Paula Severi, University of Leicester, UK
- Tarmo Uustalu, Tallinn University of Technology, Estonia
- Jeremy Yallop, University of Cambridge, UK
- Brent Yorgey, Hendrix College, US (co-chair)
# Proceedings and Copyright
We plan to have formal proceedings, published
I think Richard is referring to The function ‘f2’ is applied to three
arguments,
but its type ‘Int - Float - Char - Bool’ has only three. Note
applied to three ... but ... only three. Here n = three.
-Brent
On Fri, Dec 5, 2014 at 9:55 AM, Dr. ÉRDI Gergő ge...@erdi.hu wrote:
But it says
Int - Float - Char - Bool *is* in fact a valid type for f2, since ((-)
Char) is a Monad. However, I agree the error message is confusing,
especially the expected n, but got n part.
-Brent
On Thu, Dec 4, 2014 at 1:50 PM, Evan Laforge qdun...@gmail.com wrote:
I recently got a confusing error
The haskell.org committee is trying to figure out how to use some of
its newfound power (the Power of Collecting Money) to best benefit the
open-source Haskell community. You can help us by filling out a very
short survey (it should only take you about 5 minutes):
:
- Daniel Bergey
- Jeff Rosenbluth
- Ryan Yates
- Brent Yorgey
with contributions from:
- Jan Bracker
- Conal Elliott
- Daniil Frumin
- Sam Griffin
- Niklas Haas
- Peter Hall
- Claude Heiland-Allen
- Deepak Jois
- John Lato
- Felipe Lessa
- Chris Mears
- Ian Ross
On Tue, Sep 03, 2013 at 11:33:46AM +, AntC wrote:
I'm probably being dumb, but Hoogle nor the wiki are helping me.
I want an instance and type improvement constraint of the form
instance (f ~ (- Bool)) = C Foo (f b) where ...
The first arg to C is driving type improvement, for
On Fri, Aug 16, 2013 at 01:35:22AM +, AntC wrote:
There's an annoying inconsistency:
(CustId 47, CustName Fred, Gender Male) -- threeple
(CustId 47, CustName Fred)-- twople
-- (CustId 47)-- oneple not!
()
Hudak
Program Chair: Conal Elliott
Publicity Chair: Brent Yorgey
Program Committee
-
- Daniel Cukier (AgileAndArt)
- Conal Elliott (Tabula) (chair)
- Kathleen Fisher (Tufts University)
- Richard Gabriel (IBM Research)
- George Giorgidze (University of Tübingen)
- Paul
On Thu, Jul 11, 2013 at 03:39:02PM -0700, KC wrote:
I ask this on this mailing list because there are quite a few
mathematically oriented people here.
If you accept the Law of Excluded Middle, everything either has a
matroid structure, or not. On the other hand, if you do not accept
it, then
Maybe Euterpea?
http://haskell.cs.yale.edu/euterpea/download/
On Wed, Jul 10, 2013 at 08:20:08AM -0700, Mark Lentczner wrote:
I'm a little lost in the bewildering array of music packages for Haskell,
and need some help.
I'm looking to recreate one of my algorithmic music compositions from
On Thu, Jul 04, 2013 at 05:26:59PM +0200, Anders Bech Mellson wrote:
Is there any project that needs working this fall which could be used as a
university project?
I am in the university (M.Sc. in software development),
so I am mainly looking for project ideas (preferably concrete ones).
Hi all,
Below is the call for demonstration proposals for FARM 2013. Please
forward to anyone who might be interested -- apologies if you receive
multiple copies!
Brent Yorgey
publicity chair for FARM 2013
Hi all,
Below is the call for demonstration proposals for FARM 2013. Please
forward to anyone who might be interested -- apologies if you receive
multiple copies!
Brent Yorgey
publicity chair for FARM 2013
On Wed, Jun 19, 2013 at 11:11:16AM +0100, Francesco Mazzoli wrote:
At Wed, 19 Jun 2013 10:03:27 + (UTC),
AntC wrote:
Hi Francesco, I think you'll find that the 'annoyance' is nothing to do
with GADTs. I suggest you take the type signature off of foo1, and see
what type ghc infers for
This is great fun, more people should come and join us! =)
http://www.nomyx.net:8000/Nomyx
we are playing game demo3.
-Brent
On Fri, Jun 14, 2013 at 05:57:57PM +0200, Corentin Dupont wrote:
Hello everybody!
Here it comes, the second beta release [1] of Nomyx, the only game where
You can
. As soon as I do that, its equality
constraint of (a ~ Maybe v) enters into scope of the case branches.
Cheers,
On Wed, Jun 19, 2013 at 7:59 AM, Brent Yorgey byor...@seas.upenn.edu wrote:
On Wed, Jun 19, 2013 at 11:11:16AM +0100, Francesco Mazzoli wrote:
At Wed, 19 Jun 2013 10:03:27 +
On Wed, Jun 12, 2013 at 07:47:22AM +, harry wrote:
Tillmann Rendel rendel@... writes:
In general, I would be against removing features just because they are
confusing for beginners. I don't think that's a good design principle
for a language that is primarily targeted at
.
Submissions can be made via EasyChair at
https://www.easychair.org/conferences/?conf=farm2013
Organizers
--
Workshop Chair: Paul Hudak
Program Chair: Conal Elliott
Publicity Chair: Brent Yorgey
Program Committee
-
Daniel Cukier (University of São Paulo)
Conal Elliott
Generally, for a successful proposal you need to already find someone
who is willing to mentor the project.
Honestly, I do not think working on Yi would make for a very strong
proposal. It is definitely a cool piece of software, and definitely
worth working on, but it does not have a very large
On Tue, Apr 23, 2013 at 12:49:59PM +0200, Alberto G. Corona wrote:
Hi
I ever was worried about the barrier that the complexity of the Haskell
errors impose to users of DSLs. Many DSLs look so simple that even someone
without knowledge of Haskell can make use of them for some domains.
Hi Eric,
On Sun, Apr 14, 2013 at 10:57:43AM -0700, Eric Dobson wrote:
I am working at reimplementing the library Unbound to understand how
it works. One issue I have come up with is that an equation that I
thought held true doesn't. The equation is: Forall e::Rebind a b, e
`aeq` (uncurry
/conferences/?conf=farm2013
Organizers
--
Workshop Chair: Paul Hudak
Program Chair: Conal Elliott
Publicity Chair: Brent Yorgey
Program Committee
-
Daniel Cukier (AgileAndArt)
Conal Elliott (Tabula) (chair)
Kathleen Fisher (Tufts University)
Richard Gabriel (IBM Research)
George
(Redirecting follow-up to haskell-cafe)
Very cool! I have been hoping someone will find a way to integrate
kuler.adobe.com with diagrams, and this will help a lot. =)
https://github.com/diagrams/diagrams-lib/issues/77
-Brent
On Wed, Apr 03, 2013 at 06:49:34PM -0500, Jeremy Shaw wrote:
I am
On Fri, Mar 29, 2013 at 08:05:47AM -0230, Roger Mason wrote:
Thank you for your response. 'ghc-pkg check' shows some problems:
http://pastebin.ca/2344794
On 03/28/2013 08:01 PM, Patrick Wheeler wrote:
So I printed off the requirements for pandoc on a empty ghc-7.6.2
install you can find
On Sun, Mar 24, 2013 at 10:49:24AM -0400, Richard Eisenberg wrote:
Though I've never run into the problem Shachaf mentions, this certainly seems
useful. However, when testing Shachaf's code, I get the same error that I get
when writing an impossible branch of a case statement. I imagine that
On Sat, Mar 23, 2013 at 08:26:52PM -0700, Luke Evans wrote:
I'm curious about using Haskell for metaprogramming.
It looks like I can dynamically compile, load and run some Haskell with the
plugins package. Actually I've briefly tried this and it seems to work for
some simple cases at
On Thu, Mar 21, 2013 at 11:32:21AM +0100, matteo vezzola wrote:
I'm playing with tagless final interpreters reading [1], using a very simple
language:
class Ints repr where
int :: Integer - repr Integer
(.+.) :: repr Integer - repr Integer - repr Integer
(.*.) :: repr
On Thu, Mar 21, 2013 at 06:18:46PM +0530, C K Kashyap wrote:
Hi,
I have a situation where I need to define a data type T such that
data T = C1 Int | C2 Char | C3 T
However, I want to enforce a constraint that C3 only allows (C2 Char) and
not (C1 Int). That is
If C3 should only be able
On Mon, Mar 11, 2013 at 11:50:38AM -0700, Ben wrote:
On Mar 11, 2013, at 11:26 AM, Jason Dagit wrote:
Myself and several of my friends would find it useful to have a plotting
library that we can use from ghci to quickly/easily visualize data.
Especially if that data is part of a
On Sun, Mar 03, 2013 at 05:38:02PM -0800, bri...@aracnet.com wrote:
On Sun, 3 Mar 2013 19:58:37 -0500
Brent Yorgey byor...@seas.upenn.edu wrote:
Good access to fonts and font metrics is the kicker. Otherwise I'd
say to switch to using diagrams as a backend, hence getting a whole
On Mon, Mar 04, 2013 at 02:30:55PM -0800, bri...@aracnet.com wrote:
On Mon, 4 Mar 2013 17:27:29 -0500
Brent Yorgey byor...@seas.upenn.edu wrote:
On Sun, Mar 03, 2013 at 05:38:02PM -0800, bri...@aracnet.com wrote:
On Sun, 3 Mar 2013 19:58:37 -0500
Brent Yorgey byor...@seas.upenn.edu
On Sun, Mar 03, 2013 at 09:22:15PM +0100, Arnaud Bailly wrote:
Hello,
I am trying to install timeplot and splot on a windows 7 host, using
Haskell platform 2012.2.0.0, and I have troubles installing HSChart.
First difficulties were installing cairo, which requires Gtk+ libraries and
On Mon, Mar 04, 2013 at 11:26:23AM +1100, Tim Docker wrote:
On 04/03/13 07:22, Arnaud Bailly wrote:
Then I managed to install splot and timeplot. I then tried to use
Chart to draw a simple chart, following
On Fri, Mar 01, 2013 at 08:30:20AM +1300, Alistair Bayley wrote:
You cannot bend the split package to your needs?
http://hackage.haskell.org/packages/archive/split/0.2.1.2/doc/html/Data-List-Split.html
Some combination of splitWhen and a pcre-based predicate?
This won't work; splitWhen
On Sun, Feb 24, 2013 at 02:33:55PM +, Niklas Hambüchen wrote:
You are right, my ghc-7.4.2 was broken in ghc-pkg list; I fixed the
problem by killing my .cabal folder (as so often).
Surely you mean by killing your .ghc folder? I do not see what effect
killing your .cabal folder could
On Fri, Feb 22, 2013 at 06:44:06PM +0100, Corentin Dupont wrote:
Hi all,
I have a program able to read another program as a string, and interpret it
(using Hint).
I'd like to make unit tests, so I have a file Test.hs containing a serie
of test programs as strings.
However, how could I be
On Thu, Jan 10, 2013 at 10:34:19AM -0500, HP Wei wrote:
I did the following:
download filemanip-0.3.6.2.tar.gz
tar xvf ...
cd filemanip-0.3.6.2
runhaskell Setup configure --prefix=$HOME/ghc
-- it tells me
Setup: At least the following dependencies are missing:
mtl
I don't think that's true (though a few minutes of searching has not
yet turned up anything describing the original motivation for data
families). Sometimes you really do want to construct a family of new
data types, instead of just mapping to existing ones. I think
everyone agrees that using
On Sat, Dec 15, 2012 at 08:13:44AM +0100, Petr P wrote:
This is strange, I thought that cpphs should be specified in
build-tools:, not in build-depends:.
http://www.haskell.org/cabal/users-guide/developing-packages.html#build-information
Best regards,
Petr
Presumably the reason to list
] http://hackage.haskell.org/package/diagrams%2Dcontrib
Happy diagramming!
Brought to you by the diagrams team:
- Michael Sloan
- Ryan Yates
- Brent Yorgey
with contributions from:
- Sam Griffin
- Niklas Haas
- Peter Hall
- Claude Heiland-Allen
- Deepak Jois
- John Lato
] http://hackage.haskell.org/package/diagrams%2Dcontrib
Happy diagramming!
Brought to you by the diagrams team:
- Michael Sloan
- Ryan Yates
- Brent Yorgey
with contributions from:
- Sam Griffin
- Niklas Haas
- Peter Hall
- Claude Heiland-Allen
- Deepak Jois
- John Lato
On Wed, Dec 05, 2012 at 08:22:32PM +0100, Petr P wrote:
Dear Haskellers,
I've made some minor improvements of fixpoint package
http://hackage.haskell.org/package/fixpoint. I tried to contact the
original maintainer twice, but without success. The package hasn't been
updated for 4 years.
configuration to thread through your
interpreter.
xmonad is certainly a nontrivial example but perhaps it is a bit *too*
nontrivial. If I think of any other good examples I'll let you know.
-Brent
On Dec 3, 2012, at 1:23 PM, Brent Yorgey wrote:
On Sun, Dec 02, 2012 at 03:01:46PM +0100, Joerg
Oh, PLEASE people. Let's not have another round of bikeshedding about
this AFTER the feature is already implemented!
-Brent
On Fri, Nov 30, 2012 at 01:25:27PM +0100, Herbert Valerio Riedel wrote:
Jon Fairbairn jon.fairba...@cl.cam.ac.uk writes:
[...]
“\case” complicates lambda, using
On Fri, Nov 30, 2012 at 02:33:54AM +0100, Ben Franksen wrote:
Brent Yorgey wrote:
On Thu, Nov 29, 2012 at 03:52:58AM +0100, Ben Franksen wrote:
Tony Morris wrote:
As a side note, I think a direct superclass of Functor for Monad is not
a good idea, just sayin'
class Functor f
Oh, PLEASE people. Let's not have another round of bikeshedding about
this AFTER the feature is already implemented!
-Brent
On Fri, Nov 30, 2012 at 01:25:27PM +0100, Herbert Valerio Riedel wrote:
Jon Fairbairn jon.fairba...@cl.cam.ac.uk writes:
[...]
“\case” complicates lambda, using
On Thu, Nov 29, 2012 at 03:52:58AM +0100, Ben Franksen wrote:
Tony Morris wrote:
As a side note, I think a direct superclass of Functor for Monad is not
a good idea, just sayin'
class Functor f where
fmap :: (a - b) - f a - f b
class Functor f = Apply f where
(*) :: f (a -
On Wed, Nov 28, 2012 at 07:08:16PM +0200, Roman Beslik wrote:
Hi. There is more verbose page
http://www.haskell.org/haskellwiki/IDEs . I registered on
http://www.haskell.org/haskellwiki/ , but have not found the Delete
Page command, wiki software help pages, or feedback channel, so I'm
On Sun, Nov 25, 2012 at 06:09:26PM -0500, Albert Y. C. Lai wrote:
If you begin with cabal configure, the correct idiom is:
cabal configure [flags]
cabal build
[cabal haddock, if you want]
cabal copy
cabal register
Even this does not do the same thing as 'cabal install', because it
does
On Fri, Nov 16, 2012 at 03:25:35PM -0500, Jay Sulzberger wrote:
On Fri, 16 Nov 2012, Carter Schonwald carter.schonw...@gmail.com wrote:
how would ghc-core enable targetting core for Agda?
On Wed, Nov 14, 2012 at 6:32 PM, Andreas Abel andreas.a...@ifi.lmu.dewrote:
Excellent!
With
Turn on the ScopedTypeVariables extension (e.g. by putting {-#
LANGUAGE ScopedTypeVariables #-} at the top of your file), and add an
explicit 'forall a.' to the type signature of f.
-Brent
On Wed, Nov 14, 2012 at 04:03:57PM +0400, Serge D. Mechveliani wrote:
Please,
how to correctly set an
On Thu, Oct 18, 2012 at 11:49:08PM +0530, niket wrote:
I am a novice in Haskell but I would love to see the gurus out here
teaching Haskell on MOOCs like Coursera or Udacity.
Dr Martin Odersky is doing it for Scala here:
https://www.coursera.org/course/progfun
I would love to see Haskell
On Wed, Oct 03, 2012 at 10:41:25AM +0200, Alfredo Di Napoli wrote:
Hello everyone,
sorry for the dumb question but I'm wrapping my head around arrow just from
this morning.
Consider this toy function to swap argument of a tuple:
swapA' :: (Arrow a) = a ((b,c), (b,c)) (c,b)
swapA' =
Quite a while ago there was a mailing list thread where the idea was
brought up of creating a mailing list for those interested in
combinatorics in the setting of Haskell.
Well, I've finally gotten around to it. If you're interested in
(probably extremely low-traffic) discussion and
Quite a while ago there was a mailing list thread where the idea was
brought up of creating a mailing list for those interested in
combinatorics in the setting of Haskell.
Well, I've finally gotten around to it. If you're interested in
(probably extremely low-traffic) discussion and
Lorenzo is correct, but actually for the wrong reason. =) The *type*
of guard is a historical accident, and the fact that it requires
MonadPlus doesn't really tell us anything. Let's take a look at its
implementation:
guard :: (MonadPlus m) = Bool - m ()
guard True = return
On Sat, Sep 08, 2012 at 11:04:34AM +0400, Sergey Mironov wrote:
Hello list. Do we have a guideline for selecting correct category for
a package being developed? I'd like to choose between Web.MyLib and
Network.MyLib. Or probably just MyLib if I feel ambitious?
Sergey.
MyLib is discouraged.
On Thu, Sep 06, 2012 at 09:42:19AM +, Amy de Buitléir wrote:
I'm happy to announce a new package called grid:
http://hackage.haskell.org/package/grid
https://github.com/mhwombat/grid/wiki (wiki)
Looks neat! By the way, the URLs within the Haddock documentation are
formatted
On Mon, Aug 27, 2012 at 10:52:59AM -0700, Bryan O'Sullivan wrote:
On Mon, Aug 27, 2012 at 9:57 AM, Erik Hesselink hessel...@gmail.com wrote:
I'm seeing this again, on abstract-deque-0.1.6. Ross, can you fix it again?
Hang on a second.
The reason you're seeing build breakage is that
Correct. I just meant that you can use a lowercase x or a
lowercase chi (χ). Any lowercase characters (as defined by Unicode)
can be used as identifiers.
-Brent
On Thu, Aug 23, 2012 at 11:09:41AM -0400, dude wrote:
Not in 7.4.2, correct?
--
dude
On 08/22/2012 09:58 AM, Brent Yorgey
On Thu, Aug 23, 2012 at 01:25:39PM +0100, Patrick Browne wrote:
If there is no model expansion could it be because of the constructor
discipline, which only allows variables, and constructors in the LHS
argument patterns.
Indeed, a variable name as a pattern on the LHS of a function
I believe in the paper it is actually a lowercase Greek chi (χ), which
should work too. ;)
-Brent
On Wed, Aug 22, 2012 at 08:15:48AM +0200, José Pedro Magalhães wrote:
Nope, but it should work on 7.6 (also on the release candidate).
The 'X' should be lowercase, though, like type variables.
On Thu, Aug 16, 2012 at 06:07:06PM -0400, Joey Adams wrote:
On Wed, Aug 15, 2012 at 3:38 PM, Bryan O'Sullivan b...@serpentine.com wrote:
I propose that the sense of the recommendation around upper bounds in the
PVP be reversed: upper bounds should be specified only when there is a known
On Thu, Aug 16, 2012 at 05:30:07PM +0300, Yitzchak Gale wrote:
For actively maintained packages, I think the
problem is that package maintainers don't find
out promptly that an upper bound needs to be
bumped. One way to solve that would be a
simple bot that notifies the package maintainer
On Sat, Aug 11, 2012 at 12:13:45PM +0100, Benjamin Edwards wrote:
Hello café,
I have a program that is crashing, and I have no idea why:
module Main
where
import System.Process (readProcessWithExitCode)
main :: IO ()
main = do _ - readProcessWithExitCode ghc-pkg [describe,
On Thu, Aug 02, 2012 at 01:50:50PM +, Amy de Buitléir wrote:
I'm developing a framework for artificial life experiments that I would like
to
make available on Hackage eventually. I've read all the guidance and
proposals I
could find for where to place packages in the hierarchy:
So it looks like email confirmation for new accounts and ReCAPTCHA for
new links are both enabled, but clearly spam is still a problem. Are
there any additional measures we can take to cut down on spam?
For the record, if we need to move to a manual approval process for
new accounts, I would be
On Fri, Jul 20, 2012 at 01:24:57PM +, jwaldmann wrote:
Dear all,
how would I quickly select an element of a Set (as in Data.Set)
uniformly at random?
Via the API, this can only be done in linear time? (via toList)
If I could access the tree structure,
then of course it could be
On Thu, Jul 19, 2012 at 09:37:52AM +0800, Magicloud Magiclouds wrote:
Hi,
Say I have a package that only appends
--constraint=template-haskell==2.7.0.0
--constraint=warp-tls==1.2.1 could I install it. Now I want to
release the package, then how could I have these constraint into the
.cabal
On Mon, Jul 16, 2012 at 02:00:46PM +0200, Nathan Hüsken wrote:
Hey,
I have been a passive member of the haskell community for quite some
time now. I have benefit from the community a lot through the mailing
list, the haskell webpage and other channels. Thanks for all that!
Now I am trying
On Mon, Jul 16, 2012 at 12:03:49AM +0200, Henk-Jan van Tuyl wrote:
On Sun, 15 Jul 2012 02:39:30 +0200, Gwern Branwen gwe...@gmail.com wrote:
2. Additional administrators must be created. I suggest:
- dons
- Magnus Therning
- Neil Mitchell
- byorgey
- Henk-Jan van Tuyl
I am willing to
On Sun, Jul 08, 2012 at 09:21:08AM -0600, Jonathan Geddes wrote:
I agree that the Raison d'être for a .NET or JVM backend is interop.
Perhaps that's not worth the effort of an entirely new backend. JavaScript
is a different beast, however. I said before:
From my point of view, languages
On Sat, Jul 07, 2012 at 09:42:01PM -0300, Sebastián Krynski wrote:
Ok , thanks for the answers, I understand now what liftM2 does.
In this case would it be silly to use combinerPred (and maybe a newType
Predicate a = a - Bool) for the sake of readability or shoud I stick with
a - Bool
On Fri, Jul 06, 2012 at 03:17:54PM -0300, Felipe Almeida Lessa wrote:
On Fri, Jul 6, 2012 at 2:11 PM, Sebastián Krynski skryn...@gmail.com wrote:
As I was using predicates (a - bool) , it appeared the need for combining
them with a boolean operator (bool - bool - bool) in order to get a new
Thanks for the release! One quick question -- the release notes say
A bug in dependency analysis of type declarations in the presence
of type families (#5826) has been fixed.
However, #5826 seems to be about something entirely different
(something about the user guide). Does anyone know
On Thu, Jun 07, 2012 at 07:32:45PM +0100, ex falso wrote:
we always have to put the class restriction (TupleLength l) there,
even though all possible type constructors of [*] have a TupleLength
instance defined!
Yes, and this is a feature, for at least two reasons.
First: to the extent that
On Mon, Jun 04, 2012 at 11:35:20AM +0200, Ismael Figueroa Palet wrote:
Hi, I was wondering about defining a restricted monad, and found out this
blog post: http://blog.omega-prime.co.uk/?p=127
In GHC 7.4.1 still the recommended way is using the rmonad package,
right?
You can do it however
On Mon, Jun 04, 2012 at 11:04:36AM -0400, Victor Miller wrote:
Before I install it (on on Mac OS X Lion) is there anything, manually, that
I need to do in order to keep all of the cabal packages that I've
installed, or are the reinstalled automatically?
Neither. If you install a new version
On Wed, May 23, 2012 at 09:24:06AM +0200, Ertugrul Söylemez wrote:
Yves Parès yves.pa...@gmail.com wrote:
Note about []: Don't even mention foldl. The folding
combinator for lists is foldr, period.
Yes, I do agree. I came to this when I realized foldr gave the church
encoding
On Thu, May 17, 2012 at 03:05:22PM +0100, Chris Dornan wrote:
I have been playing around with the latest cabal-install (0.14.0) and it is
working really nicely. Having unpacked a cabal bundle you can now type
'cabal install' inside the root and it will work everything out as if you
had asked
I am curious how the title was translated. Of course, the English
title Learn You a Haskell for Great Good uses intentionally
ungrammatical/unidiomatic English for humorous effect. Is the
Japanese title also ungrammatical/unidiomatic Japanese? Or do
Japanese speakers not find that humorous?
It is possible. I have done it for
http://projects.haskell.org/diagrams/doc/index.html
But it is not fun, and it took me several days of work (spread over
two weeks) to figure out the proper magic incantations to get
everything to work properly. I really ought to write up a blog post
with
I do not think this is a bug. Since type classes are open, GHC does
not do any reasoning of the form X is the only instance in scope, so
I will pick that one. Other instances could be added at any time
(perhaps in other modules). In this particular instance, GHC has no
reason to choose the Text
selecting cabal-install-0.10.2 (source) and discarding Cabal-1.1.6, ...
Notice it's trying to reinstall the version of cabal-install that you
already have.
After doing 'cabal update', I get
[byorgey@LVN513-9:~]$ cabal list cabal-install
* cabal-install
Synopsis: The command-line
On Fri, Mar 16, 2012 at 12:30:13PM +0100, Twan van Laarhoven wrote:
If you want to avoid the side effects of boolTest2 when boolTest1
returns true, you will need to implement a monadic or, something like
orM ma mb = do
a - ma
if a then return True else mb
Note also
Hi everyone,
I am currently teaching a half-credit introductory Haskell class for
undergraduates. This is the second time I've taught it. The last
time, for their final project I gave them the option of contributing
to an open-source project; a couple groups took me up on it and I
think it
On Tue, Mar 13, 2012 at 06:06:49PM +0100, Volker Wysk wrote:
I'm sending this to glasgow-haskell-users instead of glasgow-haskell-bugs,
because the latter does not seem to accept my messages. I receive nothing,
neither the message in the mailing list, nor any error message.
As I understand
:
- Peter Hall
- Ian Ross
- Michael Sloan
- Ryan Yates
- Brent Yorgey
with contributions from:
- Sam Griffin
- Claude Heiland-Allen
- John Lato
- Vilhelm Sjoberg
- Luite Stegeman
- Kanchalai Suveepattananont
- Scott Walck
:
- Peter Hall
- Ian Ross
- Michael Sloan
- Ryan Yates
- Brent Yorgey
with contributions from:
- Sam Griffin
- Claude Heiland-Allen
- John Lato
- Vilhelm Sjoberg
- Luite Stegeman
- Kanchalai Suveepattananont
- Scott Walck
On Thu, Mar 08, 2012 at 03:13:13PM +, John Lato wrote:
From: Luana Fagarasan luana_0...@yahoo.com
Hello,
I am quite new to Haskell and I am seeking the best way to
display trees graphically when using Haskell. I have looked on
the web, but am still not clear!
IMHO Haskell is a
On Thu, Mar 08, 2012 at 07:53:48PM +0100, Christopher Done wrote:
On 8 March 2012 18:32, Anthony Cowley acow...@seas.upenn.edu wrote:
Perhaps Data.Key meets your needs?
http://hackage.haskell.org/packages/archive/keys/2.1.2/doc/html/Data-Key.html
Ah, perhaps indeed. Thanks!
On 8 March
On Sat, Mar 03, 2012 at 10:37:10PM -0500, Ras Far wrote:
letters correspond to grammar, words, or meaning. So we've got love,
too (Aramaic word “Abba” = love of God or so...)
Not quite, it's a familiar/intimate form of father, cf English
papa, dada or daddy.
-Brent
On Wed, Feb 29, 2012 at 08:02:11PM -0500, Albert Y. C. Lai wrote:
It is possible to fish the output of cabal install --dry-run -v3
hoogle for why array-0.3.0.3 is brought in. It really is fishing,
since the output is copious and of low information density. Chinese
idiom: needle in ocean
On Tue, Feb 28, 2012 at 06:06:25PM +0100, Johan Holmquist wrote:
inter :: (a - a - b) - [a] - [b]
inter f [] = []
inter f l = map (uncurry f) $ zip l (tail l)
I've never seen this function defined anywhere, but it looks nice.
withPair :: (a' - b' - c) - (a - a') - (b - b') - (a,b) - c
On Thu, Feb 23, 2012 at 01:18:22PM -0800, Matt Brown wrote:
Hi all,
I'm reading the haskellwiki article on multiplate. Is it possible to
modify the getVariablesPlate example to return the free variables?
One idea I had is to store an environment in a reader monad, and use
local to update
On Sun, Feb 12, 2012 at 02:55:40PM +0100, Andres Löh wrote:
Hi Thijs.
Sorry if this has been discussed before.
In my opinion, the main advantage of Agda goals is not that the type
of the hole itself is shown, but that you get information about all
the locally defined identifiers and their
On Sat, Feb 04, 2012 at 12:23:07PM -0600, Qi Qi wrote:
Hello,
I have a question;how can I print out the intermediate number lists in a
mergesort recursive function like the following one.
merge [] ys = ys
merge xs [] = xs
merge (x:xs) (y:ys) = if x = y
then x :
1 - 100 of 610 matches
Mail list logo
