Published papers of the Mathematics of Program Construction
Section
The following articles, which we may not distribute as a DVI-file for copyright reasons,
have been published or will appear soon:
- R.C. Backhouse, P. de Bruin, P. Hoogendijk, G. Malcolm, T.S. Voermans,
and J. van der Woude. Polynomial relators. Proceedings of the 2nd
Conference on Algebraic Methodology and Software Technology, AMAST'91,
pages 303-362. Springer-Verlag, Workshops in Computing, 1992.
- R.C. Backhouse, P. de Bruin, G. Malcolm, T.S. Voermans, and J. van der
Woude. Relational Catamorphisms. In Moller B., editor, Proceedings of
the IFIP TC2/WG2.1 Working Conference on Constructing Programs,
pages 287-318. Elsevier Science Publishers B.V., 1991.
- Roland C. Backhouse and J.P.H.W. van den Eijnde and A.J.M. van Gasteren.
Calculating path algorithms. Science of Computer Programming,
22(1-2):3--19, 1994.
- Paul F. Hoogendijk and Roland C. Backhouse. Relational programming laws
in the tree, list, bag, set hierarchy. Science of Computer
Programming, 22(1-2), pages 67--105, 1994
- G. Hutton and E. Voermans. Making Functionality more General. In
Functional Programming, Glasgow 1991, Workshops in computing.
Springer Verlag, 1991.
- Mathematics of Program Construction Group, Eindhoven University of
Technology. Fixed-point calculus. In R. Backhouse, editor, Information Processing Letters Special
Issue on The Calculational Method, 53, pages 131--136, 1995.
- E. Voermans. Pers as Types, Inductive Types and Types with Laws.
In PHOENIX Seminar and Workshop on Declarative Programming,
Sasbachwalden, Workshops in Computing, Springer-Verlag, 1991.