Re: [Haskell-cafe] What does the `forall` mean ?

Andrew Coppin wrote: > > I just meant it's not immediately clear how > > foo :: forall x. (x -> x -> y) > > is different from > > foo :: (forall x. x -> x) -> y Uhm, I guess you meant foo :: forall x. ((x -> x) -> y) VS. foo :: (forall x. x -> x) -> y , didn't you? __

Re: [Haskell-cafe] Ghci :ctags or hasktags print to standard out instead of file

foo cat foo & echo ":ctags foo" | ghci your_file.hs &> /dev/null Not the nice way, of course. Steffen ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] SLD resolution code in Haskell

Hi, is there any haskell code for SLD-resolution; I wanna learn it. Thanks a lot. Steffen. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Trying to Express Constraints using a data structure

d a DSL for GPU computations. I remember there was the problem that GPUs can't compute "maps of maps" and they solved it using a data structure: http://www.cse.unsw.edu.au/~chak/papers/LCGK09.html Hope that helps. Steffen ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Haskell Arrows Applications

ow can return several results, the Arrow combinators allow them to be used together in a clean way. There are Arrows that carry mutable state and perform IO, too. Also see the wiki page [2] and Hackage documentation [3]. It took me a while to understand what really goes on, but worked q

Re: [Haskell-cafe] Re: Converting IO [XmlTree] to [XmlTree]

onst x) is applied greatly depends on the functor and on shape. Consider the list functor and shape = repeat () against shape = [()] against shape = [] Steffen [1] http://thread.gmane.org/gmane.comp.lang.haskell.cafe/54685 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Re: Converting IO [XmlTree] to [XmlTree]

eturn, unit etc. Got it from: The Typeclassopedia by Brent Yorgey (forgot the URL, sorry) Steffen ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Re: HXT: desperatedly trying to "concat"

x27;m gonna make a big "WATCH YOUR PARENTHESES!" poster... Yeah, with some arrows on it... Thanks for reading, anyway. Steffen Neu bei WEB.DE: Kostenlose maxdome Movie-FLAT! https://register.maxdome.de/xml/o

[Haskell-cafe] HXT: desperatedly trying to "concat"

What I get out of it is this (in ghci): *Rest> runX (testData >>> mkGetStr) >>= print "method=my.Methodfoo_arg=Foo&bar_arg=Bar" There is an "&" missing right after "method=my.Method"! Why? I've tried many variants of this and they giv

Re: [Haskell-cafe] Examples of useful functions of order >= 3?

code (in whatever language) which > usefully uses functions of order >= 3?? Preferably up to 5? > > Thanks, > Ben. > > ___ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > -- Dipl.-Inform. Steffen Maza

Re: [Haskell-cafe] ghc overlapping instances -> solved

Hello, Isaac, this works for me. Thx a lot, Steffen 2007/12/5, Isaac Dupree <[EMAIL PROTECTED]>: > > Steffen Mazanek wrote: > > Hi, > > > > Stefan and Isaac, thx for providing quick advice. > > > > @Stefan: Unfortunately I have to use a list. >

Re: [Haskell-cafe] ghc overlapping instances

= True where types = progr::Program main = mapM_ (\(s,a) -> putStrLn s >> a) [("flowchart construct and parse", test prop_ConstructParse)] 2007/12/4, Stefan O'Rear <[EMAIL PROTECTED]>: > > On Tue, Dec 04, 2007 at 03:36:20PM +0100, Steffen Mazanek wrote: > &g

[Haskell-cafe] ghc overlapping instances

ghc such that it accepts such an instance? In hugs -98 +o is enough. I have tried -XOverlappingInstances, -XFlexibleInstances and also -XIncoherentInstances, however I still got an overlapping instances error for this declaration. Regards, Steffen

Re: [Haskell-cafe] Re: standard function

Cool! Haskell surprised me once again :) @Paul: Thank you for pointing me to the old thread. @Neil: Is there a way to let hoogle find this kind of stuff? It would be a quite complex inference though. 2007/6/6, apfelmus <[EMAIL PROTECTED]>: Steffen Mazanek wrote: > is there a function

[Haskell-cafe] standard function

Hello, is there a function f::[a->b]->a->[b] in the libraries? Couldn't find one using hoogle although this seems to be quite a common thing... Steffen ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/ma

Re: [Haskell-cafe] Re: CYK-style parsing and laziness

ks for the examplary implementation. This is really enlightening. Ciao, Steffen ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Re: CYK-style parsing and laziness

I have tried a nub before the list comprehension however this is evaluated too late. I should really use sets, however, I would miss the list comprehension syntactic sugar sooo much. Is there something similar for real Data.Set? Best regards, Steffen ___ Has

[Haskell-cafe] CYK-style parsing and laziness

se the gs i j are getting very large. Is there a trick to get lazy evaluation into play here? It is sufficient to find only one occurence of the start symbol in gs n 1. Best regards, Steffen ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://ww

Re: [Haskell-cafe] List algorithm

length i I wanted to iterate over all productions p, counting the number n of Nonterminals at the right-hand side of p, computing all lists with n numbers whose sum is i and split the span accordingly. It works, however, the strings have to be very, very short *g* Ciao and Thx, Steffen 2007/5/22

[Haskell-cafe] List algorithm

really hope for a polynomial algorithm although I am not very optimistic about this. Ciao, Steffen ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Profiling, measuring time

Thats it! Thanks a lot. I do not even need forceOutput, because I perform a bottom-up analysis. And the timeline I got looks sooo great (perfect polynomial behavior :-)) Best regards, Steffen 2007/5/20, Matthew Brecknell <[EMAIL PROTECTED]>: Steffen Mazanek: > I have written a f

[Haskell-cafe] Profiling, measuring time

st regards, Steffen -- Dipl.-Inform. Steffen Mazanek Institut für Softwaretechnologie Fakultät Informatik Universität der Bundeswehr München 85577 Neubiberg Tel: +49 (0)89 6004-2505 Fax: +49 (0)89 6004-4447 E-Mail: [EMAIL PROTECTED] ___ Haskell-Cafe ma

Re: [Haskell-cafe] generate Haskell code from model

ting DSLs, yeah, than it will be no problem to define a DSL for itself :-) Ciao, Steffen If thats the case, how is "Translate to Haskell" different from "Translate to C++"? It only makes a difference if you go in and edit the result, but then you've lost your model? Th

Re: [Haskell-cafe] generate Haskell code from model

ww.steffen-mazanek.de/blog/2007/05/visual-language-howto.html Best regards, Steffen 2007/4/14, Brian Smith <[EMAIL PROTECTED]>: On 4/14/07, Steffen Mazanek <[EMAIL PROTECTED]> wrote: > > Brian, but don't you think that you have to write a lot > of boilerplate code i

Re: [Haskell-cafe] Tutorial on Haskell

emember, the goal is _not_ "explain monads". It's "Haskell is a great way to Get The Job Done". Thanks! Simon _______ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Dipl.-Inform. Steffen Mazanek Institut

Re: [Haskell-cafe] generate Haskell code from model

ant to generate Haskell data structures that operate on this data. How would you procede? This is similar to HaXML that helped you to generate Haskell types for an xml schema. Best regards, Steffen -- Dipl.-Inform. Steffen Mazanek Institut für Softwaretechnologie Fakultät Informatik Univer

Re: [Haskell-cafe] generate Haskell code from model

er assume, that you have no choice and are not allowed to discuss the sense of this approach :-) How should the code look like? Best regards, Steffen 2007/4/13, Brian Smith <[EMAIL PROTECTED]>: On 4/13/07, Steffen Mazanek <[EMAIL PROTECTED]> wrote: > > Hello everybody, > >

[Haskell-cafe] generate Haskell code from model

f the model+generate approach are well known. Best practices in programming are propagated, for Haskell e.g. use different modules for different things, use the tedious import/export lists, Haddock your code... What are your ideas? Best regards, Steffen -- Dipl.-Inform. Steffen Mazanek Institut für

Re: [Haskell-cafe] Haskell Chess

wever, interesting "other" games are probably too diverse to be pressed in a general framework, aren't they? Henning Thielemann schrieb: On Mon, 19 Mar 2007, Andrew Wagner wrote: Steffen, I've done some chess AI programming in the past, so I'd be happy to help with th

[Haskell-cafe] Re: [Haskell] Haskell Chess

description used in the exercises; the English version will be the wiki (although it has no convert2tex function). Best regards, Steffen Donald Bruce Stewart schrieb: smazanek: Hello again, I got a lot of interesting and useful comments on my posting about Haskell Chess. Somebody

Re: Naive instantiation

Hello, Hugs/GHCi produce errors, of course. Nevertheless, is there any way to obtain such a feature? you could use -fglasgow-exts for ghc or -98 for hugs, respectively. Steffen ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org

Re: Problem with Infinite Lists

Hello, all_fib :: [Float] You define "all_fib" to return a list of "Float", but "even" does only work for numbers whose type is an instance of the class Integral, e.g. Int. HTH and ciao, Steffen ___ Haskell-Cafe maili

Hugs Humor

Hello, a quit funny hugs session: Prelude> 0.5::Rational 1 % 2 Prelude> 0.1::Rational 13421773 % 134217728 Prelude> 13421773/134217728 0.1 I do not know how this fraction is calculated, but it does not fit my expectations :-) Ok, ok, it is no bug... Ciao, Steffen -- Steffe

autocompletion mode for ghci?

Hallo, is there any mode for the ghci, which provides autocompletion like e.g. the bash? Thanks, Steffen Mazanek ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

<    1   2