Re: [Haskell] ANNOUNCE: string-qq-0.0.2

tricky part is "|]" occurring in the quoted text) Can we escape it? -- Steffen Best regards, Krzysztof Skrzętnicki On Tue, Jun 28, 2011 at 16:13, Dave Bayer mailto:ba...@cpw.math.columbia.edu>> wrote: Part of the dominance of scripting languages is clean support for he

Re: [Haskell] Re: Quicksearch vs. lazyness

motivating example of Haskell for the talk at the open source conference (that is currently discussed at haskell-cafe). These people are mostly really excited about performance :-) Best regards, Steffen Apparently, I did not think enough about quicksort :) as it is well capable of delivering the

[Haskell] Quicksearch vs. lazyness

k for the naive quicksort algorithm (quicksort smaller ++ [x] ++ quicksort greater), doesn't it? Is there a search algorithm that makes better use of lazy evaluation out of the box? Best regards, Steffen ___ Haskell mailing list Haskell@haskell.org

Re: [Haskell] Haskell Chess

ked me for the exercises so I started the wiki page http://haskell.org/haskellwiki/Learning_Haskell_With_Chess on this topic. I will add more content when I am back to office. Every contribution and discussion is welcome. Best regards, Steffen Steffen Mazanek schrieb: Hello, I recently i

[Haskell] Haskell Chess

of the gametree and the application of the minimax algorithm can be easily generalized. If somebody is interested I gladly provide the used project definition and the particular work orders (in German only). Best regards, Steffen Mazanek -- Dipl.-Inform. Steffen Mazanek Institut für

Re: [Haskell] main::[String]->IO() ?

Hello, thank you for all the valuable comments. A main function with arguments would correspond better to the principle of the least surprise, however, you are perfectly right with your arguments, too. getArgs is not so hard to remember I guess :-) Bye, Steffen

Re: [Haskell] main::[String]->IO() ?

Hinze (as far as I understand this (and this is not so deep) value dependent types are simulated by type classes). Bye, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

[Haskell] main::[String]->IO() ?

n or providing an alternative, e.g., main_args, just like in C or Java? I think this would simplify everyday-programming a lot. Or are there any severe theoretical (semantical) problems (main is running in the IO monad either way)? Ciao, Steffen ___ Has

Re: [Haskell] HaXml and XML Schema

elegant due to its simplicity. Bye and thx, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: GHC and Kinds

gt; But I have been thinking that it's over-kill to use Types for Kinds, and > leads to no real saving. I think so, too, because the system from "Typing Haskell in Haskell" is very easy to understand and extend. Another advantage is, that it is closer to the Haskell report. > I m

Re: literate comments

hink about this? Do you see even more advantages of this approach or would it be senseless work? Regards, Steffen Mazanek [1] http://www.openmath.org/ [2] http://www.ross.net/funnelweb/ ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.o

literate comments

Hello, in the Haskell report the latex code environment is mentioned: http://www.haskell.org/onlinereport/literate.html Would it make sense, to add a xml like code environment as well, e.g., ...? Ciao, Steffen ___ Haskell mailing list [EMAIL

Re: constructor name clashes

mains the same. Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

"Real world" example needed for ...

T (->)::- -> + -> * and T (Either)::+ -> + -> * and so on... Any ideas are very appreciated. Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: proving the monad laws

a red rag to me. Nevertheless thank you. Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Haskell for non-Haskell's sake

autiful. I miss convenient and standardized libraries for gui-programming! I think, this is a serious problem. Bye, Steffen Mazanek P.S. I do my best to motivate other people to give Haskell a try, e.g. during a lecture about document-description-languages I had provided a funny example, how usefu

proving the monad laws

ned, that there is an obligation for the programmer to prove these laws. It would be helpful as well, to provide an example! I was wondering, if it is possible to simplify: "let TI gx = f x >>=h in ...". But the "a" may occur in "h"? Thank you. Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Haskell-report, chapter 3 - Expressions

Thank you. The '10' should be explained in the report as well. Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Haskell-report, chapter 3 - Expressions

appreciated if someone could explain this part in some more detail. I am trying to introduce a new language construct into this grammar and I want to insert it at the right place :-) Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http

Re: Exhaustive Pattern-Matching

Thank you all for your help. I will try this ghc-flag. It is interesting as well, that in contrast to Haskell Standard ML ensures, that pattern-matches are exhaustive and irredundant. Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http

Exhaustive Pattern-Matching

? Maybe you have some pointers to other resources about this topic. Thank you, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: hiddencode

I have added my experiences with Haskell literate programming to the wiki: http://haskell.org/hawiki/LiterateProgramming Ciao, Steffen -- Steffen Mazanek - www.steffen-mazanek.de - GPG: 791F DCB3 Haskell, that's where I just curry until fail, unwords any error, drop all undefined,

Re: hiddencode

d like to have different font sizes in your documentation. Ciao, Steffen -- Steffen Mazanek - www.steffen-mazanek.de - GPG: 791F DCB3 Haskell, that's where I just curry until fail, unwords any error, drop all undefined, maybe break, otherwise i

hiddencode

code environments? If not I would prefer a command line option. What do you think about this? Ciao, Steffen -- Steffen Mazanek - www.steffen-mazanek.de - GPG: 791F DCB3 Haskell, that's where I just curry until fail, unwords any error, drop all undefined, maybe break, otherwise in seq

Re: labelled fields

Ok, I had missed something: I can write instead: data Type = TCon String (Maybe String) ... and declare a function lmtc lmtc (TCon _ x) = x ... But why not allow syntactic sugar? Sorry, Steffen -- Steffen Mazanek - www.steffen-mazanek.de - GPG: 791F DCB3 Haskell, that's where I

labelled fields

something? Thanks, Steffen -- Steffen Mazanek - www.steffen-mazanek.de - GPG: 791F DCB3 Haskell, that's where I just curry until fail, unwords any error, drop all undefined, maybe break, otherwise in sequence span isControl and take max $, i

Re: AW: simulating dynamic dispatch

sing hugs I get the same error :-(. No idea! Maybe some additional flags have to be set? Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: AW: simulating dynamic dispatch

a la fun::(forall a.[a]->Int)->[b]->[c]->Int Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

LambdaTeX and \usepackage{german}?

advance, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

History of Haskell, first draft

are still missing. So please understand it as a framework and base where all kinds of additional contributions are pluggable. A big thank you to all helpers. Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo

Re: Haskell History

ittle lambdas *g*. I hope to present a first draft of this website in the nearer future. Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Haskell History

quit a lot of dead links in the internet, wasting time and staying without results. Help me to close this existing gap. All suggestions are welcome. Steffen Mazanek ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

old hugs versions?

of Johan Nordlanders ohugs (http://www.cs.chalmers.se/~nordland/ohugs/). Thanks in advance, Steffen Mazanek ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Function wows

bin = foldr (\x y->x+2*y) 0 Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Tutorial for literate Haskell

} and so on Thats it. I hope this will help. Ciao, Steffen -- Steffen Mazanek Werner Heisenberg Weg 102 App. 232 85579 Neubiberg GPG key fingerprint: A165 227D B288 5E10 701D BF5F E91C 6B88 24C8 397D http://blackhole.pca.dfn.de:11371/pks/lookup?op=

Re: Tutorial for literate Haskell

uded in the main tex-file with \input{...}. Alternatively I sometimes use lambdaTeX which typesets the code really nice (problem: latex2html doesn't understand it). Hope that will help. Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http:

Re: looking for Database Interface in Haskell

Have a look here: http://haskell.cs.yale.edu/haskellDB/ ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Anyone calculating Nash or Wardrop equilibria in Haskell?

quot;way" in general, but maybe someone can give a hint, how to tackle these kinds of problems. Or maybe there are some libraries doing this job. Thanks in advance and best greetings. Steffen Mazanek ___ Haskell mailing list [EMAIL PROTECTED] http://ww

Regular expressions as Haskell Type Generators?

standard String-operations or type checking. But in praxi it may be absolutely relevant. Or is some work already done in this direction? Ciao, Steffen ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

ITRS'02 call for papers

ly once, not per workshop) PROGRAM COMMITTEE: Steffen van Bakel (Chair) (Imperial College, London, UK) Franco Barbanera (Universita` di Catania, Italia) Mario Coppo (Universita` di Torino, Italia) Luca Roversi (Universita` di Torino, Italia) Lyn T