Last call for participation: MPC '98 Fourth International Conference on MATHEMATICS OF PROGRAM CONSTRUCTION ----------------------------------- http://www.md.chalmers.se/Conf/MPC98/ June 15 - 17, 1998 Marstrand, Sweden Post-conference workshops: * Workshop on Generic Programming, WGP'98 http://www.cse.ogi.edu/PacSoft/conf/wgp/ * International Workshop on Constructive Methods for Parallel Programming, CMPP'98 http://brahms.fmi.uni-passau.de/cl/cmpp98/index.html * Formal Techniques for Hardware and Hardware-like Systems, FTH'98 http://www.cs.chalmers.se/~ms/FTH98/ The general theme of this series of conferences is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software or hardware. The conference theme reflects the growing interest in formal, mathematically based methods for the construction of software and hardware. The goal of the MPC conferences is to report on and significantly advance the state of the art in this area. Previous conferences were held in 1989 at Twente, The Netherlands, organised by the Rijksuniversiteit Groningen, in 1992 at Oxford, United Kingdom, and in 1995 at Kloster Irsee, Germany, organised by Augsburg University. Registration information can be found on the homepage of the conference: http://www.md.chalmers.se/Conf/MPC98/ Invited speakers: Burghard von Karger (Kiel University) John Hughes (Chalmers Technical University) David Harel (Weizmann Institute) CONFERENCE PROGRAMME Monday June 15 1998 8.50 - 9.00 Welcome 9.00 - 10.00 Invited talk: A proof rule for control loops Burghard von Karger (Kiel University) 10.00 - 10.30 Break Session 1. Chair: Roland Backhouse (Eindhoven University of Technology) 10.30 - 11.15 Polytypic Downwards Accumulations Jeremy Gibbons (Oxford Brookes University) 11.15 - 12.00 Nested Datatypes Richard Bird (Oxford University) and Lambert Meertens (CWI Amsterdam and Utrecht University) 12.00 - 1400 Lunch Session 2. Chair: Richard Bird (Oxford University) 14.00 - 14.45 Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach Thomas Brunn, Bernhard M�ller, and Martin Russling (Augsburg University) 14.45 - 15.30 Computing Spanning Trees Rudolf Berghammer, Burghard von Karger and Andreas Wolf (Kiel University) 15.30 - 16.00 Break Session 3. Chair: Bernhard M�ller (Augsburg University) 16.00 - 16.45 Computation Calculus - Bridging a Formalization Gap Rutger M. Dijkstra (Groningen University) 16.45 - 17.30 A Unifying Framework for Correct Program Construction Henning Dierks and Michael Schenke (University of Oldenburg) Tuesday June 16 1998 9.00 - 10.00 Invited talk: Generalising Monads John Hughes (Chalmers Technical University) 10.00 - 10.30 Break Session 4. Chair: Eerke Boiten (University of Kent at Canterbury) 10.30 - 11.15 Calculating a Round-Robin Scheduler Matteo Vaccari (University of Milano) and Roland Backhouse (Eindhoven University of Technology) 11.15 - 12.00 Formal derivaton of a loadable asynchronous counter Mark B. Josephs (South Bank University London) 12.00 - 1400 Lunch Session 5. Chair: Jose Oliveira (University of Minho at Braga) 14.00 - 14.45 An application of program derivation techniques to 18th century mathematics A. Bijlsma (Eindhoven University of Technology) 14.45 - 15.30 An Approach to Object-Orientation in Action Systems Kaisa Sere, (�bo Akademi University) Joost Kok and Marcello Bonsangue (Leiden University) 15.30 - 16.00 Break Session 6. Chair: Robin Cockett (University of Calgary) 16.00 - 16.45 Beyond Fun: order and membership in polytypic imperative programming David A. Naumann (Stevens Institute of Technology) 16.45 - 17.30 Realizability for Monotone Coinductive Definitions and Its application to Program Synthesis Makoto Tatsuta (Kyoto University) Wednesday June 17 1998 9.00 - 10.00 Invited talk: On the Aesthetics of Diagrams David Harel (Weizmann Institute) 10.00 - 10.30 Break Session 7. Chair: Sigurd Meldal (CalPoly) 10.30 - 11.15 Convergence of Program Transformers in the Metric Space of Trees Morten Heine Sorensen (University of Copenhagen, DIKU) 11.15 - 12.00 A set-theoretic model for real-time specification and reasoning C.J. Fidge, I.J. Hayes, A.P. Martin and A.K. Wabenhorst (University of Queensland) 12.00 - 1400 Lunch Session 8. Chair: Christian Lengauer (University of Passau) 14.00 - 14.45 An elementary derivation of the Alternating Bit Protocol W.H.J. Feyen, A.J.M. van Gasteren (Eindhoven University of Technology) and Birgit Schieder (M�nchen Technical University) 14.45 - 15.30 Slack elasticity in concurrent computing Rajit Manohar and Alain J. Martin (Caltech) 15.30 - 16.00 Break Session 9. Chair: Mary Sheeran (Chalmers Technical University) 16.00 - 16.45 A Semantic Approach to Secure Information Flow K. Rustan M. Leino (DEC SRC) and Rajeev Joshi (University of Texas, Austin) 16.45 End of Mathematics of Program Construction 1998 VENUE Marstrand is a small island on the beautiful westcoast of Sweden, 40 km from G�teborg. The charming old houses, the fortress, the walking paths, and the absence of cars make this island a very pleasant resort. There are direct flights to G�teborg Landvetter from most European main cities, and busses from G�teborg to Marstrand. PROGRAMME COMMITTEE Ralph-Johan Back Finland Roland Backhouse The Netherlands Richard Bird UK Eerke Boiten UK Dave Carrington Australia Robin Cockett Canada David Gries USA Lindsay Groves New Zealand Wim Hesselink The Netherlands Zhenjiang Hu Japan Barry Jay Australia Johan Jeuring Sweden (Chair) Dick Kieburtz USA Christian Lengauer Germany Lambert Meertens The Netherlands Sigurd Meldal Norway Bernhard M�ller Germany Chris Okasaki USA Jose Oliveira Portugal Ross Paterson UK Mary Sheeran Sweden Doug Smith USA LOCAL ORGANISATION MPC '98 is organised by the Computing Science department of Chalmers University of Technology and University of G�teborg. The organisation committee consists of the following people: Patrik Jansson Johan Jeuring Marie Larsson Mary Sheeran