[Apologies for multiple copies]
==
Registration for DGP 2006 is now open. Please visit the web site for
instructions.
Spring School on Datatype-Generic Programming
http://www.cs.nott.ac.uk/ssdgp2006/
conference dinner will be organised (attendance at which will be
charged seperately).
Organisers
Roland Backhouse (University of Nottingham)
Jeremy Gibbons (University of Oxford)
Ralf Hinze (Universitat Bonn)
Johan Jeuring (Universiteit Utrecht)
Fermin Reig (University
(+49) 341 9732 204/209 --
>
Hi,
If you can write an ASDL definition for the .sdf tree, asdlGen will
generate read/write code for you in Haskell (or SML/Java/C/C++).
Look at http://www.cs.princeton.edu/zephyr/ASDL/ if you don't know
about ASDL or asdlGen.
HTH.
Fermin Reig
>
> | Also, you say a dependency with zero variables on the right side is
> | syntactically correct, but later you say it will be reported as an
> | error because it says nothing. Why bother?
>
> Point taken. In fact that same database text I mentioned above
> prohibits functional dependencies
> Hi all... has anyone implemented the Union-Find algorithm in
> Haskell?
Hi Keith,
I can point you to one written in ML. It comes with MLRISC.
ftp://ftp.research.bell-labs.com/dist/smlnj/working/110.20/110.20-MLRISC.tar
.Z
It's in the library subdirectory. The whole thing is ~600kb. If you
> > Miranda has something called diagonalizing list
> comprehensions if I recall
> > correctly. I think you would write:
> >
> > [(a,b) // a <- [1..], b <-[1..]]
> >
> > and the resulting list would be
> >
> > [(1,1), (1,2), (2,1) ...]
>
> Haskell has this too. :) The syntax is almost the sa
>
> > I find this a little surprising. In general, any algebraic datatype
> > satisfying the conditions in Appendix D of the report should be
> > enumerable, using the same lexicographic ordering used in D.1 for Eq
> > and Ord.
>
> [..]
>
> > Any problems with this?
>
> I've seen one problem
papers are:
"Early Experience with ASDL in lcc", Software-Practice and Experience,
to appear.
"A Machine-Independent Debugger-Revisited", Microsoft Research TR 99-4
both available at http://www.research.microsoft.com/~drh/
> If anyone is interested in any of these facilities, drop us an email.
Do keep the mailing list informed of your progress!
Regards,
Fermin Reig
ouple of mirror sites of Haskell.org would also be a good
idea.
Fermin Reig
---
Fermin J. Reig
PhD student, Department of Computing Science, University of Glasgow
http://www.dcs.gla.ac.uk/~reig
