On Thu, Sep 2, 2010 at 3:25 AM, Jan Christiansen
j...@informatik.uni-kiel.de wrote:
I prefer
False = _|_ = True
Sorry to go a bit off topic, but I find it funny that I never really
noticed you could perform less-than or greater-than comparisons on
Bool values. What's the semantic reasoning
On 30 August 2010 11:26, Andrew Coppin andrewcop...@btinternet.com wrote:
Stephen Tetley wrote:
Windows has a standard place for header files
path-to-MinGW\MinGW\include
Isn't that MinGW has a standard place for header files?
Strictly speaking its Haskell-on-Windows has a standard place
On 29 August 2010 02:06, Brandon S Allbery KF8NH allb...@ece.cmu.edu wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 8/28/10 20:43 , michael rice wrote:
Historical accident, to wit: Haskell 98 minimally defined Either in the
Prelude, so in practice we get the basic definitions
On 29 August 2010 07:58, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
One might also say that that's because there is no BiFunctor in the
report, standard library, etc.
Yep - that's where the historical accident comes in.
___
Haskell-Cafe
On 29 August 2010 13:24, Hamish Mackenzie
hamish.k.macken...@googlemail.com wrote:
Use TakeOffGW (http://sourceforge.net/projects/takeoffgw/) to install :
Hi Hamish
Does TakeOffGW work well in practice? The intentions behind it are
admirable but at the moment it seems rather new.
On 29 August 2010 18:06, Brandon S Allbery KF8NH allb...@ece.cmu.edu wrote:
DLLs can be put into C:\WINDOWS\SYSTEM32 or equivalent (e.g. Windows NT
liked to install itself in C:\WINNT instead of C:\WINDOWS). LIB files are
less standard and I'm under the impression that every IDE uses its own
On 23 August 2010 14:03, Eugene Kirpichov ekirpic...@gmail.com wrote:
Do there exist other nontrivial higher-order algorithms and datastructures?
Is the field of higher-order algorithms indeed as unexplored as it seems?
Aren't higher order algorithms functional pearls? :-)
You might find
On 24 August 2010 13:00, John Lato jwl...@gmail.com wrote:
This is how I think of them. I particularly your description of them as a
foldl with a pause button.
Maybe it would be helpful to consider iteratees along with delimited
continuations?
Aren't they closer - in implementation and by
The function image style always described as from Point to ...
[insert Picture, Bitmap, Texture...] is also inherently higher order.
Examples are Conal Elliott's Pan, Jerzy Karczmarczuk's Clastic and
Peter Henderson's images.
In Clastic and Pan, the higher order image seems like a characteristic
Thanks for taking a look - I've never got round to investigating the
connection properly but have noticed the strong similarity between the
data type defintions of the ResT and Iteratee.
William Harrison makes the interesting point in the Cheap Threads
papers that by itself the resumption monad
On 23 August 2010 06:12, Erik de Castro Lopo mle...@mega-nerd.com wrote:
I'm going to be a bit of a heretic here and suggest that you attack
this problem from the other end. How you ask?
Install Debian Testing/Unstable with Wine in a VM and cross compile
to Windows.
No - that's a
... done.
Loading package base ... linking ... done.
Loading package ffi-1.0 ... linking ... done.
Prelude
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Andrew, I was going to chastise you for being the only Windows
developer who has problems with MinGW / MSYS and spreading that
unpleasant internet commodity FUD. However, I've just gone back to
mingw.org and its gone from somewhat confusing circa the last time I
installed (Christmas 2009) to
On 22 August 2010 13:48, Felipe Lessa felipe.le...@gmail.com wrote:
I take it that the problem is that libcurl is a C library with a
Unix-like build system, and that is the problem that needs Cygwin,
right?
No - generally you don't want to compile bindings with Cygwin,
compiling with Cygwin
On 22 August 2010 16:56, Tillmann Rendel
ren...@mathematik.uni-marburg.de wrote:
One needs a compiler and libraries on the one hand, and a bunch of
command-line tools on the other hand. On Windows, MinGW provides the former,
while Cygwin provides a package manager to install the latter.
Its
There are some instructions here for building curl with minGW
http://haskell.forkio.com/Home/curl-win32
I've never needed curl myself so haven't first hand experience, but
the guide is pretty recent thus one might expect it to work.
___
Haskell-Cafe
)
are distributed with the Platform.
For what its worth, Regex-posix worked fine with Platform 2009.2.0.2.
I follow GHC releases rather than Platform ones, so I don't know about
later versions.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe
On 17 August 2010 12:45, Kevin Jardine kevinjard...@gmail.com wrote:
I was assuming that regex would work properly with the latest Haskell
Platform so I haven't attempted to re-install it.
Yes - its wise not to upgrade platform components, especially on Windows.
However as I mentioned above,
Hi Kevin
Is it a library on Hackage? I'll take a look if the dependencies
aren't too deep...
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Kevin
I've just installed Platform-2010.2.0.0 and I'm getting the symbol
error on the file that I could compile with Platform2009.2.0.2.
So I'd say it is a bug with the Platform, also it looks like the error
was acknowledged on the Platform mailing list last week.
$
On 17 August 2010 14:15, Kevin Jardine kevinjard...@gmail.com wrote:
[snip]
So sorry for the waste of bandwidth.
No - its good to have a solution in public. The issue tracker seemed a
bit inconclusive, but anyone reading an archive of the mailing list
will now be able to pick up what to do.
On Tue, Aug 17, 2010 at 6:05 AM, Hemanth Kapila saihema...@gmail.com wrote:
Hi,
Can some one please give me a suggestion on the best choice for an embedded
scripting Language for a haskell application?
I mean, something like guile/lua for c/c++ and groovy/jruby for java.
For quite some time,
On 15 August 2010 08:50, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Yeah, I'm working on something like this at the moment, but I'm
currently stuck on naming: if I want to have Functor for kind * - *,
what's a good name for a type class for kind *?
Conor McBride has suggested
On 14 August 2010 11:19, Andrew Coppin andrewcop...@btinternet.com wrote:
As I understand it, ATs were invented because FDs are evil and must never
be used ever for any purpose. However, it doesn't seem to be possible to use
ATs to do the same things that FDs can do.
You might want to read
://www.haskell.org/pipermail/haskell-cafe/2010-July/079784.html
If I was doing Wumpus again though, I'd probably do with Pointwise.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 14 August 2010 20:27, Stephen Tetley stephen.tet...@gmail.com wrote:
If I was doing Wumpus again though, I'd probably do with Pointwise.
Ahem, do without Pointwise
Originally the types I operated on with Pointwise were more
complicated than they are now and Pointwise seemed a benefit
needed the latest PartAudio release, I couldn't get
previous stable stable versions to compile with MinGW.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Aug 12, 2010 at 10:50 PM, Eitan Goldshtrom
thesource...@gmail.com wrote:
In C++, maybe Java, I remember using a Robot to change the location of the
mouse on the screen. My intention is to do something like in an FPS game
where the mouse is always centered to make sure it doesn't run
The problem was noted in this thread a couple of months ago:
http://www.haskell.org/pipermail/haskell-cafe/2010-June/078914.html
I'm not sure what the resolution was.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Maybe this paper is close?
Type-safe diff for families of datatypes
Eelco Lempsink Sean Leather Andres Löh
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
At version 2 Parsec was an amalgamation of a state and error monad -
by amalgamation I mean the data types and Monad instance encoded the
combination directly, it wasn't made from transformers. Version 3 of
Parsec complicates things a quite a bit.
If you're addressing Perl programmers, you could
On 6 August 2010 20:47, David Sankel cam...@gmail.com wrote:
There have been some clever things done with monads aside from #1 and #2.
Parsec is one, but it seems applicative functors are a better match for the
parsing domain.
Monadic bind is very, very handy for parsing, giving you context
On Aug 3, 8:31 pm, Jeremy Shaw jer...@n-heptane.com wrote:
The only area I have had any trouble with Haskell is doing realtime
music synthesis. And only because the garbage collector is not
realtime friendly. That is not unfixable though. However, I am
thinking that the best way to do
On 31 July 2010 06:45, wren ng thornton w...@freegeek.org wrote:
Ben wrote:
dear traversable geniuses --
i am looking for better implementations of
unzipMap :: M.Map a (b, c) - (M.Map a b, M.Map a c)
unzipMap m = (M.map fst m, M.map snd m)
I don't think you can give a more efficient
On 31 July 2010 12:13, wren ng thornton w...@freegeek.org wrote:
Well, that's one traversal of the original map, but you have to traverse the
new maps repeatedly with all those M.insert calls. And since Data.Map is a
balanced tree, that could lead to a whole lot of work rebalancing things.
choice these days though. Again, unfortunately I don't have experience
of building it with MinGW to share, you might have to do some
improvisation to get it to work.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
.
Doaitse Swierstra's parser combinators have error correction.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Jason
Which particular file in the Darcs tree defines the parser?
Small adhoc formats don't necessarily have a simple underlying
grammar, even though a parser for them might not have many
productions. A hand-crafted parser for such a format might often be
context-sensitive, or do clever
On 25 July 2010 13:09, Andrew Coppin andrewcop...@btinternet.com wrote:
This is not valid in Haskell '98. This is actually a type system extension
known as multi-parameter type classes, which do not even vaguely
correspond to anything in normal OOP. (Except for being very slightly
similar to
Volker Stolz and Frank Huch implemented Erlang style
distribution/concurrency for Haskell quite a while ago - a search
should turn up the relevant papers, the code might have disappeared.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 22 July 2010 16:56, Thomas DuBuisson thomas.dubuis...@gmail.com wrote:
The hackage build logs can be misleading - many system specific
packages may or may not build on hackage because it just isn't the
right OS. Still other packages require particular C libraries that
the hackage server
On 21 July 2010 20:17, Christopher Done chrisd...@googlemail.com wrote:
Hi Kevin,
You probably have to install the mingw versions of these libraries.
Should be trivial to do with mingw's installation manager. Or was that
cygwin? The one with the package manager. I haven't used Windows for a
build.
lhs2Tex uses user hooks extensively.
If that's too complicated, my own library Wumpus-Core uses a preSDist
hook in Setup.hs to make sure I've bumped the version number before I
ship the library.
Best wishes
Stephen
___
Haskell-Cafe mailing list
On 18 July 2010 21:23, Andrew Coppin andrewcop...@btinternet.com wrote:
As somebody who occasionally releases (admittedly useless) packages on
Hackage, it's really quite irritating that there isn't an easy way to say
what changed.
(As for scanning a repo to find changes, that's very
2010/7/15 Jake McArthur jake.mcart...@gmail.com:
On 07/14/2010 05:01 PM, Victor Gorokhov wrote:
You can implement pure pointers on top of Data.Map with O(log n) time
Or on top of Data.IntMap with O(1) time. ;)
Unlikely...
From the docs, lookup is O(min(n,W))
it could build
interfaces across the JNI bridge in Java.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/html/doc-index-A.html
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the package haskore-vintage (also on
Hackage) which is the original Haskore, and see if you can get it to
work with that.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of the applicative style it introduced.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello all
For manipulating records I use an arity family of so-called Starling
combinators - they seem a pleasant if low-powered solution. To me, the
infix combinator style of Data-Accessor quickly ends up looking like a
particulary angry exchange between Snoopy and Woodstock[1].
star :: (a
Hello
I suspect you will have to choose single examples for each of the
patterns/ abstractions you are interested in.
Doaitse Swierstra's library UU.Parsing is the originator or the
Applicative style. Its latest incarnation is the library
uu-parsinglib.
There is extensive technical report
On 5 July 2010 10:39, Yves Parès limestr...@gmail.com wrote:
Then what is your alternative? How do you replace monad transformers?
Possibly more a case of doing without rather than replacing them with
something else, you would amalgamate all the monadic effects you want
into one monad.
E.g.
On 5 July 2010 11:30, Ertugrul Soeylemez e...@ertes.de wrote:
That's what monad transformers are good for. Why reinvent the wheel?
Hi Ertugrul
The post was chiming in with Felipe Lessa's comment upthread that
avoiding transfomers can have performance benefits.
Whether the formulation I gave
2010/7/4 Stephen Tetley stephen.tet...@gmail.com:
There is a least one of paper giving a rigorous comparison of SML
functors and Haskell type classes, unfortunately I can't remember the
authors. The link below is a (long) thesis:
http://www.informatik.uni-freiburg.de/~wehr/publications
If you add Rest as an alternative constructor to Item you should be
able to attribute Items with their duration rather than their onset
position. For most processing this would simplify things.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 4 July 2010 21:34, Michael Mossey m...@alumni.caltech.edu wrote:
Hi Stephen,
Thanks for thinking about this. The problem, though, is that notes can
overlap in time.
True - Haskore solves this with the Par operator allowing parallel
musical lines.
ABC and LilyPond have voice overlays - bars
On 3 July 2010 14:00, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
So this argument isn't valid ;-)
Hi Ivan
I think it was Hugs compliant as least for some revisions - I seem to
remember looking at it before I switched to GHC.
___
On 3 July 2010 14:18, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
Stephen Tetley stephen.tet...@gmail.com writes:
I think it was Hugs compliant as least for some revisions - I seem to
remember looking at it before I switched to GHC.
People still use Hugs? :p
A bit more seriously
On 3 July 2010 14:20, Andrew Coppin andrewcop...@btinternet.com wrote:
Tangentally, it seems to me that all monads can be described as doing zero
or more of:
- Invisibly pass state around (and possibly modify it).
- Perform unusual flow control.
- I/O (or some restricted subset of it).
Can
Hello Andrew
The non-type-changing map is sometimes useful as a type class - in my
graphics lib Wumpus, I call it pointwise:
class Pointwise sh where
type Pt sh :: *
pointwise :: (Pt sh - Pt sh) - sh - sh
For the graphics I want objects to be parametric on unit (which is
usually Double),
On 3 July 2010 15:04, Andrew Coppin andrewcop...@btinternet.com wrote:
I said does something that doesn't fall under one of these. The identity
monad, by contrast, does nothing that does fall under these. :-P (It falls
under zero of these.)
Okay, how about:
The probability monad
The
For an applicative parser - many is the same combinator as Parsec's
many and some is many1.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Erik
Malcolm Wallace describes a commit combinator in the paper Partial
parsing: combining choice with commitment which sounds like what you
would want. It is implemented for Polyparse rather than Parsec though.
From a quick scan of the paper and code, the implementation appears to
be built
the Applicative/Monad instances actually model.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Michael
Good names are a problem of course.
The Applicative Programming with Effects Paper has the monodial
accumulating applicative instance on a sum type Conor McBride and
Ross Paterson call Except:
data Except err a = OK a | Failed err
The names are nice and to the point, but they would
is from Lennart Augustsson's
Cayenne - a language with dependent types
The papers on Cayenne might be an interesting start point as the field
was less mature at that time, so the early papers had more explaining
to do.
Best wishes
Stephen
___
Haskell
/012378.html
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/staged/TermLift.hs
His solution requires quite a bit of machinery - Template Haskell, a
TypeCheck type class...
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 24 June 2010 08:08, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
As an aside, Alex Mason and I are discussing the possibility of taking
advantage of AusHack *shameless plug* to write some kind of classes
for the different types of containers with a hierarchy. I know about
ListLike,
On 24 June 2010 08:20, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
My rational for a class approach is that rather than having your
library spit out a list of values, etc. you let the consumer pick
which data type they prefer (if they're going to be just converting
your list into a Set,
2010/6/24 Serguey Zefirov sergu...@gmail.com:
I should suggest code generation from Haskell to C#/Java and PHP.
Like Barrelfish, Atom, HJScript and many others EDSLs out there.
You will save yourself time, you will enjoy Haskell. Probably, you
will have problems with management because
purposes.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
files.
http://hackage.haskell.org/package/tiger
You could try contacting Doaitse Swierstra for the original UUAG source.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
by Bruno Oliveira, Tom
Schrijvers and William Cook here:
http://tomschrijvers.blogspot.com/2009/09/effectiveadvice-aop-mixin-inheritance.html
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
://userweb.cs.utexas.edu/users/wcook/Drafts/2009/sblp09-memo-mixins.pdf
There are probably some other instances where it takes more expertise
to spot - certainly Oleg Kiselyov and Ralf Lammel's OO-Haskell paper
uses open recursion, but in a slightly different way.
Best wishes
Stephen
On 17 June 2010 16:12, Patrick LeBoutillier
patrick.leboutill...@gmail.com wrote:
This paper was very interesting to me. Does anyone know if the full source
code
for the Haskell prototype is available somewhere?
Chapter 8 of Paul Hudak's School of Expression contains a version of
the region
.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 15 June 2010 15:13, Stephen Tetley stephen.tet...@gmail.com wrote:
There is actually no corresponding *lib* directory, but haddock still
works fine.
This is a mistake on my part - I do have a corresponding lib directory
which includes a package.conf.d directory - for GHC-6.12.1 (I
[2] - section 2.11 Advanced: Separate scanners.
[1] http://web.cecs.pdx.edu/~sheard/papers/JfpPearl.ps
[2] http://legacy.cs.uu.nl/daan/download/parsec/parsec.pdf
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
On 14 June 2010 18:00, Patrick LeBoutillier
patrick.leboutill...@gmail.com wrote:
Hi all,
On Mon, Jun 14, 2010 at 1:42 AM, Aran Donohue aran.dono...@gmail.com wrote:
resources. John Lato's recent Iteratee article is a notable exception*.
Can anyone provide a link to the article (if it's
with hyperlinks in the
html source rather than just colourizing, but I'm not sure what
happened to it - maybe it is part of Programatica?
http://ogi.altocumulus.org/~hallgren/Programatica/
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe
project could supply a commentary on
the original documentation - Parsec - Cliff's notes, detailing where
the differences are, but in practice they don't vis my point that
libraries advance ahead of their documentation.
Best wishes
Stephen
___
Haskell
list with the first element of
the two and drop the second.
Trying to code an algorithm at speed 1 with the list functionals
presents a significant hurdle towards clarity of exposition...
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe
on it. This can still be
done with package-hiding but its less straight-forward.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
speaking
using MinGW / MSYS to build and install bindings is the solution.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
If the function is changing the size of the list (e.g. by removing
duplicates) a name implying 'mapping' might be misleading.
Maybe something like /process/ or /normalize/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 7 June 2010 20:44, Chris Dornan ch...@chrisdornan.com wrote:
Also, what's with
C:\Program Files\Haskell
Platform\2010.1.0.0\lib\..\mingw\bin\windres: can't open temporary file
`\/cca01252.irc': No such file or directory
Hi Chris
I don't know what's going on there, are you using
powerful internal machinery.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
,
though I believe there is a C parser for the ANTLR system which is
LL(k).
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
cleanly and
fairly trivially add IO as the bottom layer of the monad stack -
CompilerM - e.g. compileFile :: TeX - CompilerM Dvi.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Forked to the Cafe...
Hi all
What's the procedure for marking one's own package(s) as deprecated on Hackage?
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Brandon
Even that's not simple - freetype is essentially a framework for
writing font processors rather than a conventional C library[*]. Saner
perhaps is to write a C program using freetype to do the exact job you
have in mind, then bind to your C program.
Best wishes
Stephen
[*} Probably
Thanks Bas
I've just emailed Ross, so that should be one zombie down when he
has the chance to update Hackage.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
:\Users\Ralph\AppData\Roaming\cabal\curl-1.3.5runhaskell setup install
setup: permission denied
Don't you want to be installing the curl binding through MinGW's shell
rather than going back to the Windows shell?
Best wishes
Stephen
___
Haskell-Cafe
Don't you want to be installing the curl binding through MinGW's shell
rather than going back to the Windows shell?
By that I mean the Bash shell provided by MSys, which you should have
installed along with MinGW...
___
Haskell-Cafe mailing list
module requires a couple of tricks - import it qualified and re-define
unqualified versions of the parsers you need - int, symbol, identifier
- etc.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
Of interest, (.+.) is the T combinator - called (##) in Peter
Thiemann's Wash and the queer bird in Raymond Smullyan's To Mock a
Mockingbird.
Your technique might well relate to the 'element transforming style'
of Wash, see the Modelling HTML in Haskell paper.
Best wishes
Stephen
using then you'll get a name conflict.
The GHC style guide has better[*] reasons for avoiding them:
http://hackage.haskell.org/trac/ghc/wiki/Commentary/CodingStyle
[*] Better - as in it conforms to my prejudice
Best wishes
Stephen
___
Haskell
- for instance why do you need a map type that is polymorphic
on shape?
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
lasttime}) infos
Make similar functions for last_logout, referring_url.
Best wishes
Stephen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
301 - 400 of 663 matches
Mail list logo
