n is (serious) games. The division mainly contributes to the education in the bachelor programs information science and computer science, and to the master program Computing Science.Additional informationFor more information please contact Prof.dr. Johan Jeuring +31.30.253.4115 or +31.6.400.10
, for solving it.
More information:
http://www.cs.uu.nl/wiki/USCS/
Please forward this announcement to potential participants.
Best,
Doaitse Swierstra, Atze Dijkstra and Johan Jeuring
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Hi Henning,
Thanks for the many suggestions.
On Sun, 6 Sep 2009, Johan Jeuring wrote:
The primary features of Palindromes include:
* Linear-time algorithm for finding exact palindromes
* Linear-time algorithm for finding text palindromes,
ignoring spaces, case of characters, and
On 07 Sep 2009, at 21:21, Rafael Cunha de Almeida wrote:
Johan Jeuring wrote:
Palindromes
==
Palindromes is a package for finding palindromes in files.
Visit the homepage
http://www.jeuring.net/Palindromes/
A few options are not working well
eral concerns and questions, email the author:
johan at jeuring.net
Licensing
-
Palindromes is licensed under the so-called BSD3 license. See the
included
`LICENSE` file.
Credits
---
Palindromes is based on the functional program developed by Johan
Jeuring in
his PhD thesis.
those you get many other generic functions for free.
See
http://hackage.haskell.org/package/emgm
-- Johan Jeuring
For example, for
data Tree a = Leaf a | Node (Tree a) (Tree a)
you would have:
instance Zippable Tree where
tryZip (Leaf a) (Leaf b) = Right (Leaf (a,b))
tryZip
erpret your question correctly, you want a fold for a set of
mutually recursive datatypes without type parameters. This function is
available in the generic programming library multirec:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/mul
ic programming problem. Recent
releases include the EMGM and SYB libraries for generic programming.
-- Johan Jeuring
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ry defines folds for
mutually recursive datatypes.
The released version of multirec doesn't include the TH files
for generating the boilerplate code (for example, embedding-projection
pairs for datatypes) necessary for using the library. However,
the head has TH support for this.
All t
generic programming
techniques, you can read (shameless plugs):
Alexey Rodriguez Yakushev, Johan Jeuring, Patrik Jansson, Alex Gerdes,
Oleg Kiselyov, Bruno C. d. S. Oliviera. Comparing Libraries for Generic
Programming in Haskell. In Andy Gill, editor, Proceedings of the ACM
SIGPLAN Haskell Symposium
Dear Johannes,
Besides the IPT course, we also teach a course hat used to be called
grammars and parsing. This course is taken before the compiler
construction course. In this course we deal with parser combinators,
datatypes, folds, first and follow, LL(1), and some more stuff, all
in Haskell. T
the Software Technology group on http://
www.cs.uu.nl/wiki/Center
More information about the Information and Computing Sciences
department on http://www.cs.uu.nl/
More information about this vacancy can be obtained from Johan
Jeuring ([EMAIL PROTECTED], http://www.cs.uu.nl/~johanj/, +31 6
Want to show off your programming skills? Your favorite programming
language?
Your best programming tools?
Join the ICFP Programming Contest 2007! The 10th ICFP Programming
Contest
celebrates a decade of contests. This is one of the world's most
advanced and prestiguous programming contest y
, rewriting, strategies, generic programming,
etc. will be
useful.
More information about the project can be found on
http://ideas.cs.uu.nl/wiki/index.php/IDEAS:StrategicFeedback
or contact Johan Jeuring ([EMAIL PROTECTED], +31 6 40010053).
To apply:
send a letter and your curriculum vitae
approaches to
generic programming. I'm not sure if this is what you
are looking for, but it is at least related. See the paper
Comparing approaches to generic programming in Haskell
available via
http://www.cs.uu.nl/~johanj/publications/publications.html
Kind regards,
Johan Jeuring
On 12-jul
Who wants to try devloping a new shell with me?
Also:
http://www.cse.unsw.edu.au/~dons/h4sh.html
And (in Clean):
Rinus Plasmeijer and Arjen van Weelden. A functional shell that
operates on typed and compiled applications. In Varmo Vene and Tarmo
Uustalu, editors, Advanced Functional Prog
Has anyone any news about an Advanced Functional Programming
school, which was scheduled for 2006 ?
We discussed organising one in the Netherlands, but haven't finished
the discussion yet. I don't expect it is going to happen in 2006.
Hopefully in 2007?
-- Johan
_
Has anyone written a pure haskell xslt interpreter? If not, how
difficult would it be to do so?
A master student of mine implemented XSLT in Haskell a couple of
years ago.
I've uploaded his thesis on
http://www.cs.uu.nl/~johanj/MSc/danny.pdf
If you're interested in the code, mail me. His
.
I'm pleased to announce the Haskell Workshop Steering Committee,
which has been approved by ACM SIGPLAN.
You can find more information about the Haskell Workshop and its
Steering Committee on
http://www.haskell.org/haskell-workshop/
-- Johan Je
organizers
will be posted in the next couple of months.
-- Johan Jeuring
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
We pass values as proxies for types extensively in the "Scrap your
boilerplate" scheme. The paper is on my home page. The 'typeOf'
function is a good example.
Passing types as arguments to functions is the main idea behind generic
programming, intentional programming, polytypic programming, etc
are, which is not enough).
So how to go about it? Using DrIFT? Template Haskell?
[Shameless plug]:
This is typically the kind of thing Generic Haskell was designed for:
http://www.generic-haskell.org/
For more information you can also consult your local Generic
Programming expert Patrik
Implementing Combinator Languages, In: Advanced Functional Programming,
Third International School, AFP'98, Springer-Verlag, LNCS 1608,
150-206,1999.
-- Johan Jeuring
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
>> You don't need meta-programming technology (reflection) to do things
>> like
>> generic prinitng. A generic programming extension of Haskell (like
>> Generic Haskell, or derivable classes) can do the job for you.
>
> Isn't generic programming usually based on a kind of compile-time
> reflectio
> My point is that there are some things that can't easily be expressed
> in current Haskell (like generic printing) that are useful and
> might be aided by meta-programming technology. The interesting question
> is can it be done in a way that preserves whatever we want from the type
> system: sa
ut as far as I know nothing
has been decided yet. I will try to start up something (which doesn't mean
I will organise it!) soon.
-- Johan Jeuring
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
26 matches
Mail list logo