Günther,
On 10/27/2010 05:12 PM, you wrote:
For some reason it has become acceptable to
politicalize a subject at the earliest convenience and take the gloves off.
You were the first offender, when you wrote the following:
since there is no mail client library even after 10+ years I suggest
cas...@istar.ca wrote:
Is it possible to easily connect Haskell to JavaScript/JavaFX in
the browser and use a browser as a Windows GUI? :)
...
I meant call Haskell functions from a browser; so the browser handles
the GUI widgets and Haskell handles the processing. :)
It's pretty easy to get
Andrew Coppin wrote:
I'd like to have a go at writing CGI in Haskell.
...
Does anybody know of a solution that works on Windows?
I've previously run Happstack on Windows. That was a couple of years
ago, though, so I don't know whether its Windows support is currently
working.
Daniel Fischer wrote:
On Friday 27 August 2010 16:54:09, sylvain wrote:
Hi,
the results given by the same research at the world level is worrisome:
the interest in Haskell is steadily declining since 2004. Why was
Haskell not successful conquering the hearts? Is it doomed to fail or is
there
Jason Catena wrote:
On Jul 30, 11:17 am, Anton van Straaten wrote:
Prelude :m Control.Monad.State
Prelude Control.Monad.State let addToState :: Int - State Int ();
addToState x = do s - get; put (s+x)
Prelude Control.Monad.State let mAdd4 = addToState 4
Prelude Control.Monad.State :t mAdd4
m
C K Kashyap wrote:
In the code here -
http://hpaste.org/fastcgi/hpaste.fcgi/view?id=28393#a28393
If I look at the type of modifiedImage, its simply ByteString - but
isn't it actually getting into and back out of the state monad? I am of
the understanding that once you into a monad, you cant
On Jul 30, 9:59 am, Kevin Jardine kevinjard...@gmail.com wrote:
The original poster states that the type of modifiedImage is simply
ByteString but given that it calls execState, is that possible?
Would it not be State ByteString?
Oops, I should have written
IO ByteString
as the State
Kevin Jardine wrote:
I think that these are therefore the responses to the original
questions:
I am of the understanding that once you into a monad, you cant get out of it?
You can run monadic functions and get pure results.
Some clarifications:
First, many monads (including State) are
Kevin Jardine wrote:
I think that we are having a terminology confusion here. For me, a
pure function is one that does not operate inside a monad. Eg. ++,
map, etc.
Ivan Miljenovic has already given a good response, to which I'll only
add this:
I suspect that your idea of the meaning of
Kevin Jardine wrote:
As a Haskell newbie, the first thing I learned about monads is that
they have a type signature that creates a kind of mud you can't wash
off.
There are places where you can't wash it off, and places where you can.
eg.
f :: String - MyMonad String
By mentioning the
Ionut G. Stan wrote:
Thank you all for the answers. It seems that a recurring reason is that
being defined as a general type, Either can be used not only to handle
errors, but choice in general. This, however, seems to make Either to
overloaded in my opinion. If I decide that I want to use
Günther Schmidt wrote:
is there a function which will format a number with separators,
something that will turn 14509.8674 into 14,509.86?
There's a small function to do it here:
http://bluebones.net/2007/02/formatting-decimals-in-haskell/
___
Tim Newsham wrote:
I was wondering how many haskell consultants and contractors
(ie. freelance programmers) there are and how much demand there
is for their work. Also what kind of work do most haskell
consultants and contractors get? Is it primarily focused
around developing and maintaining
Paul Johnson wrote:
On 15/12/09 21:19, Anton van Straaten wrote:
Without that advocacy, this client would have used Java by default.
As it was, the first of those two systems was developed in parallel
with a Java version, and we used the two versions to verify each
other's results
Gregg Reynolds wrote:
On Tue, Dec 15, 2009 at 3:19 PM, Anton van Straaten
an...@appsolutions.com mailto:an...@appsolutions.com wrote:
Without that advocacy, this client would have used Java by default.
As it was, the first of
I'd be interested in how you pulled that off
,
this makes it easier to make the case of a competitive advantage to be
had -- if there were no other users, the question would be if it's so
good, why isn't anyone else using it?
The existence of a few papers and presentations about use of Haskell use
in finance also helps.
Anton van Straaten
Andrew Coppin wrote:
This is the thing. If we had a class specifically for containers, that
could be useful. If we had a class specifically for algebras, that could
be useful. But a class that represents any possible thing that can
technically be considered a monoid seems so absurdly general
Deniz Dogan wrote:
2009/11/5 Andrew Coppin andrewcop...@btinternet.com:
Matus Tejiscak wrote:
zygohistomorphic prepromorphisms
Please tell me this isn't a real technical term. o_O
http://www.haskell.org/haskellwiki/Zygohistomorphic_prepromorphisms
Still can't tell if it's a joke or not...
Colin Paul Adams wrote:
Gregory == Gregory Crosswhite gcr...@phys.washington.edu writes:
Gregory Yes, I was once taught that Every time you use
Gregory unsafePerformIO, God kills a kitten, so every time I
Gregory consider using it I first ask myself: is this really
Gregory
Gregory Collins wrote:
Sean Leather leat...@cs.uu.nl writes:
On Thu, Oct 8, 2009 at 16:35, Gregory Collins wrote:
Sean Leather leat...@cs.uu.nl writes:
Do you know if it's possible to permanently patch happstack-server?
I'm guessing the TH in the patch is used to support multiple
Bryan O'Sullivan wrote:
On Fri, Oct 9, 2009 at 7:25 AM, Gregory Collins g...@gregorycollins.net
mailto:g...@gregorycollins.net wrote:
There's been an open ticket for months; personally I think this is a job
for the C preprocessor, but nobody's written a patch yet.
Is there an open
jerzy.karczmarc...@info.unicaen.fr wrote:
American people will call it a discussion about semantics, and
we, European will not understand why this word is used in a pejorative
context...
Semantics *should* be a pejorative word unless it refers to something
formally specified, and preferably
Colin Paul Adams wrote:
Does anyone recognize which module/function would emit the following
warnings?
WARNING: nonstandard use of escape in a string literal
LINE 11: '# Pandoc\r\n\r\nPandoc is a program for converting ...
^
HINT: Use the escape string syntax for
S. Doaitse Swierstra wrote:
I am trying to run happstack on my Mac, but unfortunately I am getting
error messages as described in:
http://code.google.com/p/happstack/issues/detail?id=88
The cure seems to be to downgrade to network-2.2.0.1, but unfortunately
my installed cabal depends on
Günther Schmidt wrote:
My app then needs to read in dynamic data, a set of 4 CSV files, and I
had been using Microsofts ODBC driver with HDBC.ODBC and that worked too.
When I try to swap it for Takusen though I get an
*** Exception: DBError (HY,C00) 106 [Microsoft][ODBC Text Driver]
John Van Enk wrote:
No, I just want to know if there are any gotchas in the typical VPS
setups that for some strange reason wouldn't like Haskell binaries. I
couldn't think of any, but I miss details some times.
One detail you should check is that the VPS has enough memory for the
Haskell
3MB? You're going to host Hello World on a VPS? ;)
John Van Enk wrote:
Yeah, it crossed my mind, but since my application only uses 3MB of
memory in Linux, I think I'll be ok. :)
On Thu, Jul 23, 2009 at 11:38 AM, Anton van
Straatenan...@appsolutions.com wrote:
John Van Enk wrote:
No, I
Kim-Ee Yeoh wrote:
Consider
data Task = Task { title :: String, completed :: Bool, subtasks :: Maybe
[Task] }
Note that unless you have some meaning in mind for the difference
between a subtask value of Nothing vs. (Just []), the Maybe is redundant.
Anton
Felipe Lessa wrote:
On Wed, Jul 22, 2009 at 06:00:38PM +0200, Matthias Görgens wrote:
] I need to take some elements from the front of a list. However the
] criteria are somewhat complex.
]
] walk f [] = []
] walk f (x:xs) = case f x
] of Just g - x : walk g xs
]
Fernan Bolando wrote:
Program error: Prelude.!!: index too large
This is not very informative. It did not give me a hint which function
was causing this.
In addition to the debugging methods that have been mentioned, the
Safe library provides a way to write the code more robustly and/or
Henry Laxen wrote:
I have tried several things, the most recent being:
RewriteEngine on
RewriteRule ^/(.*)$ /hackTest?input=$1 [T=application/x-httpd-cgi]
Location /
SetHandler fastcgi-script
Options ExecCGI FollowSymLinks
/Location
but the pathInfo field is always null.
Path info
GHC amused me today with this error (context omitted):
Couldn't match kind `(* - *) - * - *' against `?? - ? - *'
When matching the kinds of `t :: (* - *) - * - *' and
`(-) :: ?? - ? - *'
It was a silly mistake: I had used 'lift' where I intended to use
FFT wrote:
On Wed, May 6, 2009 at 8:20 PM, Anton van Straaten
an...@appsolutions.com wrote:
The app is written for a client under NDA, so a blog about it would have to
be annoyingly vague.
No doubt the potential for encountering space leaks goes up as one writes
less pure code, persist more
Jason Dagit wrote:
I know from experience that lambdabot tends to be leaky. Otherwise,
lambdabot wouldn't be running on my server to begin with. And, even
so, Cale monitors lambdabot to make sure it is not using too many
resources (and I complain when/if I notice it). I have heard similar
Jason Dagit wrote:
On Wed, May 6, 2009 at 3:54 PM, Anton van Straaten
an...@appsolutions.com wrote:
FWIW, I have an internal HAppS application that's been running continuously
since November last year, used daily, with stable memory usage.
Do you have advice about the way you wrote you app
michael rice wrote:
Since I'm trying to learn Monads, let's look at this as a teaching
moment. The example code (see below), which I pulled off YAMT (Yet
Another Monad Tutorial ;-)), is the source of my 'comb' function.
I understand the code as it now stands, and I understand that the
Thomas Hartman wrote:
I was playing with Text.XHtml.Table but couldn't use it to output tables.
( cell . toHtml $ a ) `beside` (cell . toHtml $ b )
tr
a b /tr
already seems wrong -- should be two cells, right? And the result
doesn't get embedded in a table tag?
'cell' is not a TD
Malcolm Wallace wrote:
However, despite having not yet cast any vote, I now find that the
voting site gives me:
404 Not Found
The requested URL /~andru/cgi-perl/civs/vote.pl was not found on this server.
The URL I have starts with /w8/ :
Gregg Reynolds wrote:
What is distinctive about Haskell it's use of the monad. The
The Pythagorean monad symbol is wonderfully simple:
http://en.wikipedia.org/wiki/Monad_(Greek_philosophy)
It has the added benefit that if you put a pair of those on the chest of
a suitably curvy cartoon
Maurício wrote:
Here in Brazil we have a forest animal we name 'preguiça' -- literally,
lazyness. What better mascot we could have for Haskell? It lives (and
sleeps) in trees, and if you see the main picture in wikipedia articles
you can easily imagine the tree branch beeing replaced by a
Colin Paul Adams wrote:
I want to implement the negascout algorithm for the game I'm writing.
Wikipedia gives the algorithm in imperative terms:
http://en.wikipedia.org/wiki/Negascout
I've tried to translate this into Haskell. I'm not sure if I'm going
about it the right way, and if I am, if
There's also the Condorcet Internet Voting Service:
http://www.cs.cornell.edu/andru/civs.html
gregg reynolds wrote:
See also www.surveymonkey.com
Bulat Ziganshin bulat.zigans...@gmail.com wrote:
Hello haskell-cafe,
http://zohopolls.com/
___
Gregg Reynolds wrote:
Action-at-a-distance is a metaphor meant to enliven the concept.
Kind of like the container metaphor?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Philippa Cowderoy wrote:
On Fri, 16 Jan 2009, Duncan Coutts wrote:
If you or anyone else has further concrete suggestions / improvements
then post them here now! :-)
Spell out what associativity means
It probably makes sense to do as Jeremy Shaw suggests and explicitly
list the monoid
Andrew Coppin wrote:
Abstraction is a great thing to have. I'd just prefer it to not look so
intimidating;
What makes it look intimidating?
If the answer is it looks intimidating because the documentation
consists of nothing more than a mathematical term, without a definition,
and a
Andrew Coppin wrote:
Duncan Coutts wrote:
[Monoids are] used quite a lot in Cabal. Package databases are monoids.
Configuration files are monoids. Command line flags and sets of command
line flags are monoids. Package build information is a monoid.
OK, well then my next question would be
Niklas Broberg wrote:
I still think existential quantification is a step too far though. :-P
Seriously, existential quantification is a REALLY simple concept, that
you would learn week two (or maybe three) in any introductory course
on logic. In fact, I would argue that far more people
Sittampalam, Ganesh wrote:
Lennart Augustsson wrote:
I think the documentation should be reasonably newbie-friendly too.
But that doesn't mean we should call Monoid Appendable.
Appendable is just misleading, since Monoid is more general than
appending.
Then why does it have a member named
John Goerzen wrote:
Though if all we're talking about is naming, I would still maintain that
newbie-friendly naming is a win. We can always say HEY MATHEMETICIANS:
APPENDABLE MEANS MONOID in the haddock docs ;-)
This is backwards.
The real problem here is that most people coming from other
Derek Elkins wrote:
No, it means exactly what you said it means. People abuse it to mean
the second sense. Those people are wrong and there is already a term
for that second sense, namely partial application. I really wish
people would stop conflating these terms*, all it does is create
Luke Palmer wrote:
I, like many arrogant Haskellers, reject Scheme and other such impure
languages as functional. At least until I turn on my brain.
If Haskell is functional, then so is Scheme - it's just that Scheme lets
you use IORefs and the IO monad without going to nearly as much
Andrew Coppin wrote:
Don Stewart wrote:
This could be a game changer.
In what way? As far as I'm aware, .NET never really caught on and has
long since become obsolete.
Wha? Microsoft's programming languages all now depend on and compile to
.NET runtime (the CLR), including C#,
Jason Dagit wrote:
2008/10/6 John Van Enk [EMAIL PROTECTED] mailto:[EMAIL PROTECTED]
...
The best I can do is HaskVPN. This name is so bad I'm afraid to
admit it. A better suggestion would be much appreciated.
My advice so to find something cute, like an animal, and use that in the
Andrew Coppin wrote:
If so, I guess that means I have to somehow construct ResultSetT. Is
there an easy way to do that, given that I already have ResultSet?
I haven't been following this thread closely, so forgive if this was
already discussed, but my understanding is that the answer is no,
Dougal Stanton wrote:
2008/10/3 Galchin, Vasili [EMAIL PROTECTED]:
Hello,
One of my interests based on my education is grand challenge science.
Ok .. let's take the CERN Hadrian Accelerator.
Where do you think Haskell can fit into the CERN Hadrian effort
currently?
Where do you
Andrew Coppin wrote:
I thought ErrorT was a class name...?
No, it's the name of the error monad transformer type. Error is just
an ordinary monad, it's ErrorT that's the transformer. So it sounds
like the answer to your question below:
You could try using an exception monad transformer
Achim Schneider wrote:
Jon Fairbairn [EMAIL PROTECTED] wrote:
Adrian Neumann [EMAIL PROTECTED] writes:
I often wonder how many cuts you need to divide a steak in n
pieces. You can obviously get n pieces with (sqrt n) cuts
by cutting a grid. But I'm sure some smart mathematician
thought of
Andrew Coppin wrote:
The other day, I sat down to eat a 2 Kg block of chocolate - one of
those ones that's divided into lots of little squares. I proceeded to
recursively subdivide it into smaller and smaller blocks, and then eat
the individual squares in depth-first order. It was only after
Tim Newsham wrote:
I'm goofing with TH and I have my program mostly done:
http://hpaste.org/10713
If I have the $(deriveBinary ''MyData) line commented out it
prints out what looks to me like correct code. I can even paste
it into a program and it compiles.
Pasting the text output can
Achim Schneider wrote:
Rich Neswold [EMAIL PROTECTED] wrote:
On Thu, Sep 25, 2008 at 11:09 AM, Manlio Perillo
[EMAIL PROTECTED]wrote:
...
But this works only if the database is used by only one process.
Ah. When you said concurrent safe, I thought you meant within the
application. You're
Michael Feathers wrote:
I wrote this function the other day, and I was wondering if I'm missing
something.. whether there is already a function or idiom around to do this.
unlist3 :: (a - a - a - b) - [a] - b
unlist3 f (x:y:z:xs) = f x y z
I was also wondering whether the function can be
David MacIver wrote:
Independently of the rant...
On Sat, Apr 19, 2008 at 6:01 AM, Jonathan Cast
[EMAIL PROTECTED] wrote:
But why do I need to jump through these hoops for a perfectly safe
commonly desired operation?
It's called a proof obligation. Haskell is not here to stop you from
Hans Aberg wrote:
There are two processes here: deriving, i.e., inheriting an interface;
and instantiating, i.e., producing running code. Haskell denotes
derivation by =. And data a deriving (b_1, ..., b_k) is really a
short for
data a
instance b_1 where compiler implementation
...
Hans Aberg wrote:
On 8 Apr 2008, at 16:32, Anton van Straaten wrote:
There are two processes here: deriving, i.e., inheriting an
interface; and instantiating, i.e., producing running code. Haskell
denotes derivation by =. And data a deriving (b_1, ..., b_k)
is really a short for
data
I want to unescape an encoded XML or HTML string, e.g. converting quot;
to the quote character, etc.
Since I'm using HaXml anyway, I tried using xmlUnEscapeContent with no
luck, e.g. with HaXml 1.19.1:
let (CString _ s _) =
head $ xmlUnEscapeContent stdXmlEscaper $
[CString False This
Ashley Yakeley wrote:
GADT rhymes with cat. The d is silent, like the Danish godt, or
the German Stadt, or the American trademark Bundt.
As long as you don't pronounce it like gat in Dutch and Afrikaans,
which literally means hole, but also has a vulgar sense which means
anus or ass/arse:
Ashley Yakeley wrote:
Anton van Straaten wrote:
Those who believe that GADTs are unnecessary might appreciate the
guttural pronunciation of gat: which is something like chut where
the ch is similar to that in loch, and for good measure, it rhymes
with slut (at least in Afrikaans). It lends
Emir Pasalic wrote:
And is the plural 'gatte'? :)
Indeed!
Many a sports fan backing the wrong team at the wrong time has been told
something like Ons het julle gatte lekker geskop, which is Afrikaans
for We kicked your asses good.
On Mar 16, 2008, at 11:18 PM, Anton van Straaten wrote
Colin Paul Adams wrote:
Cale == Cale Gibbard [EMAIL PROTECTED] writes:
Cale So, the first version:
Cale import System.IO import Control.Exception (try)
Cale main = do mfh - try (openFile myFile ReadMode) case mfh
Cale of Left err - do putStr Error opening file for reading:
Richard Kelsall wrote:
I mentioned in the previous thread that some longer words weren't
getting indexed. It looks like this has been fixed. All the long words
I just tried worked properly. And, better than Google, the words get
indexed as soon as they are changed. I tried searches for words
Derek Elkins wrote:
On Wed, 2008-01-30 at 22:19 -0500, Anton van Straaten wrote:
...
We discover a function called, say, cos, probably by guessing it's
name, run a very small number of simple tests on it, see the answers we
expect, and decide that it's the function we want. Does anyone want
Henning Thielemann wrote:
On Thu, 31 Jan 2008, Anton van Straaten wrote:
Derek Elkins wrote:
Arguably, this
-is- more defensible on a safety/correctness grounds than reading the
documentation. Documentation can be out of date or wrong or right but
the implementation is wrong. So it comes
Derek Elkins wrote:
On Thu, 2008-01-31 at 02:18 +, Neil Mitchell wrote:
...
It isn't something that would throw a C programmer off, but it is
something that could confuse a pure Haskell programmer. And the only
way I could be sure of radians versus degrees was by trying it out,
not a great
[EMAIL PROTECTED] wrote:
Tim Chevalier writes:
... I think the usual convention is to
pronounce names in the manner of the language that the person who has
the name speaks. (Preferably just to pronounce people's names the way
they say them.)
(The first convention doesn't work with my last name,
Tim Chevalier wrote:
I suppose you would really want to ask Haskell Curry how *he*
pronounced his name, but it's a bit late for that.
Someone could ask Alonzo Church, Jr. how his one-time date pronounced
her father's name:
Tim Chevalier wrote:
On 1/28/08, Anton van Straaten [EMAIL PROTECTED] wrote:
Tim Chevalier wrote:
I suppose you would really want to ask Haskell Curry how *he*
pronounced his name, but it's a bit late for that.
Someone could ask Alonzo Church, Jr. how his one-time date pronounced
her father's
[EMAIL PROTECTED] wrote:
[McCarthy's] aim was to use the mathematical
formalismus as languages and not as calculi. This is the root of
the historical fact that he never took the Lambda-Calculus conversion
rules as a sound basis for LISP implementation.
So, I believe it is not so briliant an
[EMAIL PROTECTED] wrote:
On 2008.01.17 00:58:19 +0100, [EMAIL PROTECTED] scribbled 0.9K characters:
Achim Schneider writes:
Lisp is actually not really meant to be compiled, but interpreted.
...
Would you mind stopping to spread dubious truths?
...
I don't think it's a dubious truth.
Don Stewart wrote:
Note that using string overloading we can remove some of the toHtml's...
{-# LANGUAGE OverloadedStrings #-}
instance IsString Html where fromString = toHtml
main = do
time - getClockTime
putStrLn . prettyHtml $
(header (thetitle testing))
Peter Verswyvelen wrote:
But I'm amazed that impure (albeit strong) languages like LISP and
Scheme are still used for projects... I mean, in Scheme you can set!
the addition operator to become a multiplication operator at runtime,
modifying global behavior... Now that's a side effect, C/C++ is
Don Stewart wrote:
anton:
OTOH, the freedom to change things on the fly can be nice to have, and
if used with great responsibility (mainly an understanding of what's
safe to do and what isn't), the downside can be vanishingly small.
It can be small, unless you need to have any kind of static
81 matches
Mail list logo
