Ik had ook al aan Johan gemeld dat het woord talented suggereert dat er bij
jullie ook non-talented personen werken. Hij zou het aan laten passen.
Doaitse
Op 4 jan. 2018 09:13 schreef "Swierstra, W.S. (Wouter)" :
> We are currently advertising vacancies for
>
>
> 6 talented Assistant Professor
tion based on questions asked
http://www.cs.uu.nl/wiki/USCS/
-- on this page you can find the poster you can print and hang somewhere (why
not your office door):
Furthermore we ask for your cooperation to bring this announcement under the
attention of potential participants.
Best,
Doaitse
On Aug 21, 2012, at 13:46 , Heinrich Apfelmus wrote:
> Doaitse Swierstra wrote:
>> Heinrich Apfelmus wrote:
>>> I have a small question: Last I remember, you've mainly been using
>>> your UUAGC preprocessor to write attribute grammars in Haskell,
>>> es
On Aug 19, 2012, at 10:40 , Heinrich Apfelmus wrote:
> Doaitse Swierstra wrote:
>> Over the years we have been constructing a collection of Embedded
>> Domain Specific Languages for describing compilers which are
>> assembled from fragments which can be compiled individuall
On Aug 19, 2012, at 10:40 , Heinrich Apfelmus wrote:
> Doaitse Swierstra wrote:
>> Over the years we have been constructing a collection of Embedded
>> Domain Specific Languages for describing compilers which are
>> assembled from fragments which can be compiled individuall
s Sem modules to see how we use our first class
attribute grammars to implement the static semantics associated with the
various tasks of the challenge.
We hope you like it, and comments are welcome,
Marcos Viera
Doaitse Swierstra
___
Haskell
ter:
http://www.utrechtsummerschool.nl/index.php?type=courses&code=H9
Furthermore we ask for your cooperation to bring this announcement under the
attention of potential participants.
Best,
Doaitse Swierstra
PS: apologies if you get this mail more than once
___
H
The uu-parsing library support every ata type that is an instance of
Data.Listlike
(http://hackage.haskell.org/packages/archive/ListLike/3.0.1/doc/html/Data-ListLike.html#t:ListLike)
and thus input from Data.Bytestring.Lazy.
A very small starting program can be found below. Note that here we a
from the
Computer Science department make Utrecht University the optimal
surroundings for such a project.
-
Project leaders are Prof.dr. Doaitse Swierstra and
dr. Vincent van Oostrom (principal investi
ear
future as we incorprorate more of the uulib library into the new package
Pros:
- suggestions are welcome
Doaitse Swierstra
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
We are pleased to announce the availability of the package
"ChristmasTree", which contains the code associated with our paper at
the last Haskell symposium:
@inproceedings{1411296,
author = {Marcos Viera and S. Doaitse Swierstra and Eelco Lempsink},
title = {Haskell, do y
We are pleased to announce the availability of the package "TTTAS",
which contains the code associated with our paper at the coming TLDI
workshop:
[EMAIL PROTECTED] BSV09,
author = {Arthur Baars and S. Doaitse Swierstra and Marcos Viera},
title = {Typed Transformations of Type
We are pleased to announce the availability of the package "TTTAS",
which contains the code associated with our paper at the coming TLDI
workshop:
[EMAIL PROTECTED] BSV09,
author = {Arthur Baars and S. Doaitse Swierstra and Marcos Viera},
title = {Typed Transformations of Type
We are pleased to announce the availability of the package
"ChristmasTree", which contains the code associated with our paper at
the last Haskell symposium:
@inproceedings{1411296,
author = {Marcos Viera and S. Doaitse Swierstra and Eelco Lempsink},
title = {Haskell, do y
that?
Doaitse Swierstra
On Apr 3, 2007, at 11:40 PM, Paul Johnson wrote:
Sukit Tretriluxana wrote:
Unfortunately my instructor disagrees that the topic is relevant.
In his response, he mentioned that he will accept the topic only
if I can prove the following.
Haskell has been around for quite a
takes away the noise in the heading of the current GHC notation
(which is just plain confusing), and enables e.g. grouping of common
alternatives,
Doaitse Swierstra
On Oct 11, 2006, at 11:42 PM, Lennart Augustsson wrote:
Well, Kent Petersson and I proposed them as an addition to Haskel
/vacatures/en/62612.html
Doaitse Swierstra
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Lrc was developed in my group, and was taken home by Joao Saraiva,
after finishing his Ph.D. thesis.
We are not maintaining it anymore, since we have switched to our new
attribute grammar system:
http://www.cs.uu.nl/wiki/HUT/AttributeGrammarSystem
For building editing environments we have
You may find some useful code (that is still in need of
beautification, but on the other hand: it works) at:
http://www.cs.uu.nl/wiki/WebFunctions
Doaitse Swierstra
On 2006 mrt 03, at 20:30, Aditya Siram wrote:
Hi all,
I am former imperative programmer (Java/C/Python) I have recently
make some of the exercises. Our students somehow
manage ;-}
http://www.cs.uu.nl/wiki/Ipt/WebHome
Doaitse Swierstra
On 2006 jan 25, at 17:23, Bulat Ziganshin wrote:
Hello Jules,
Wednesday, January 25, 2006, 12:29:48 AM, you wrote:
JJ> I would like to create a scripting language, similar
Or (since we started to do someone's homework anyway)
generate 0 = [[]]
generate n = [x:rest | x <- [1..n], rest <- generate (n-x)]
Doaitse Swierstra
On 2005 nov 25, at 10:29, Tomasz Zielonka wrote:
On Thu, Nov 24, 2005 at 05:52:23PM +0100, Jan van Eijck wrote:
Like so:
On:
http://www.cs.uu.nl/wiki/WebFunctions/
you may find some code that could get you started. It includes a
small webserver based on Simon Marlow's design,
Doaitse Swierstra
On 2005 nov 13, at 21:29, Tomasz Zielonka wrote:
On Sat, Nov 12, 2005 at 01:10:03PM -0800, Gregory Wood
At least I can provide you with a bibtex parser written using the
Utrecht Parser Combinators. As you will see from the text the bibtex
format is actually quite intricate.
Doaitse Swierstra
-- $Header:
/data/cvs-rep/uust/examples/bibtex-parser/BibtexParser.hs,v 1.8
2002/11/08 12:48:00
all this implicitly available paralellism. All these
projects failed beacuse Moore's law overtook their results.
Doaitse Swierstra
On 2005 jan 20, at 3:13, Ben Lippmeier wrote:
I thought the "lazy functional languages are great for implicit
parallelism" thing died out some time ag
error messages online in
the IO monad while parsing
(using unsafeInterleavedIO)
- are compatible with the syntax macro mechanism we have
implemented (beta):
http://www.cs.uu.nl/~arthurb/index.html
Doaitse
--
--
__
S. Do
uot;,'b','_')
t permtest ""
Errors:
Symbol 'b' was inserted at end of file, because 'c' or 'b' or ('a')*
was expected.
Result:
("",'b','_')
The manual is still of an earlier version and will be adap
t;Adding more twiddles means less eager matching. I don't know whether
>Hugs implements this.
>
>Simon
>
>| -Original Message-
>| From: S. Doaitse Swierstra [mailto:[EMAIL PROTECTED]]
>| Sent: 01 March 2001 11:26
>| To: [EMAIL PROTECTED]
>| Subject: strictn
a collection of ~'s should
not make a difference. Am I right with this interpretation?
A possible source of this problem may be origination from the smarter
GHC optimiser, but in that case the optimiser is not doing its wo
is working on a port of the GHC
to MacOS X. He has reached the state where he managed to compile some
programs (e.g. our attribute grammar system and combinator libraries).
Doaitse Swierstra
--
__________
S. Doaitse Swierstra,
ject. Is there a workaround for the overlapping instances?
>
>Regards.
>
>Romildo
>--
>Prof. José Romildo Malaquias <[EMAIL PROTECTED]>
>Departamento de Computação
>Universidade Federal de Ouro Preto
>Brasil
>
>___
>Haskell mailing list
>[EMA
ith the error
correcting library you will find there too, but is in no way tied to
it and might be used with other libraries just as well. We are about
to release a new version of our combinators, with a library of
scanner constructing combinators. If you are prepared to live with
also fixed a couple of small bugs in the scanner module and added
some "Unsafe and Dirty Combinators" that allow you to interfere with
the correction process. You should probably not use these if you do not
understand the correction process underlying the combinators.
s may be a bit misleading, since it is well known
fact that not all context free languages can be parsed
deterministically.
I hope this software is useful to you. If you have any comments do not
hesitate to contact me.
Doaitse Swierstra mailto:[EMAIL
printing combinators?
I hope this software is useful to you. If you have any comments do not
hesitate to contact us.
Doaitse Swierstra mailto:[EMAIL PROTECTED],[EMAIL PROTECTED]
__
S. Doaitse Swierstra, Department of
,,AFP3 Proceedings
You may not have noticed, but Springer has published
the proceedings of the AFP3:
,,@book{AFP3,
author= {Doaitse Swierstra and Pedro Henriques and Jos\'{e}
Oliveira},
title = {Advanced Functional Programming, Third Internat
At:
http://www.cs.uu.nl/groups/ST/haskell.pdf
you may find a pdf version of the current haskell 1.4 report. You may read
and browse through it with the Acrobat redaer. Some of you might find this
more pleasing than the html version,
Doaitse Swierstra
PROTECTED], for a more or
less complete set of files,
Doaitse Swierstra
by many that an assignment not only assigns a new
value to a variable, but is at the same time a form of static garbage
collection. The programmer implicitely states explicitely that the old
value is no longer of interest. This is were state-monads and
uniqueness-types coincide.
Doaitse Swie
38 matches
Mail list logo