: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
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
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
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 quite
well then.
Steffen
[1] http://hackage.haskell.org
: every monad is an applicative; every
applicative is a functor; every functor is pointed.
Uhm, isn't it:
class (Functor f) = Pointed f where
pure :: a - f a -- singleton, return, unit etc.
Got it from: The Typeclassopedia by Brent Yorgey (forgot the URL, sorry)
Steffen
()
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
or multiple results (what I don't want either).
I'd be really happy if someone could save my day and help me with this issue.
Thanks in advance,
Steffen
Neu bei WEB.DE: Kostenlose maxdome Movie-FLAT!
https://register.maxdome.de/xml
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/order/LpWebDe?ac
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.
@Isaac: I do not get it. Could you please provide a short
::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:
Hello,
I want to quickcheck a property on a datatype representing
programs
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
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/mailman/listinfo
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 f::[a-b
implementation. This is really enlightening.
Ciao,
Steffen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
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://www.haskell.org/mailman/listinfo/haskell
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
___
Haskell-Cafe mailing list
Haskell-Cafe
of 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
]) would do the job,
however I am looking for a more efficient approach. Help is greatly
appreciated, even a google search term would be fine :-) I really
hope for a polynomial algorithm although I am not very optimistic
about this.
Ciao,
Steffen
___
Haskell
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 function f
,
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 mailing list
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?
The other thing is that defining a domain specific language is well
-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 in Haskell?
I have never felt I was writing
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
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
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 Softwaretechnologie
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,
I would like to start a discussion on how
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
Universität der Bundeswehr München
85577
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
, 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 this project. I have some pretty
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 mailing list
[EMAIL PROTECTED]
http
101 - 129 of 129 matches
Mail list logo