1. MPC 1989: Groningen, The Netherlands

Jan L. A. van de Snepscheut (Ed.): Mathematics of Program Construction, 375th Anniversary of the Groningen University, International Conference, Groningen, The Netherlands, June 26-30, 1989, Proceedings. Lecture Notes in Computer Science 375 Springer 1989, ISBN 3-540-51305-1 BibTeX

@proceedings{DBLP:conf/mpc/1989,
  editor    = {Jan L. A. van de Snepscheut},
  title     = {Mathematics of Program Construction, 375th Anniversary of the
               Groningen University, International Conference, Groningen, The
               Netherlands, June 26-30, 1989, Proceedings},
  booktitle = {MPC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {375},
  year      = {1989},
  isbn      = {3-540-51305-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

Jean-Raymond Abrial: A Formal Approach To Large Software Construction. 1-20 BibTeX
K. Mani Chandy: Mathematics of Program Construction Applied to Analog Neural Networks. 21-35 BibTeX
Eric C. R. Hehner: Termination is Timing. 36-47 BibTeX
David May, David Shepherd: Towards Totally Verified Systems. 48-65 BibTeX
Lambert G. L. T. Meertens: Constructing a Calculus of Programs. 66-90 BibTeX
Jayadev Misra: Specifications of Concurrently Accessed Data. 91-114 BibTeX

Contributed Lectures

Ralph-Johan Back, Kaisa Sere: Stepwise Refinement of Action Systems. 115-138 BibTeX
Ralph-Johan Back, Joakim von Wright: A Lattice-theoretical Basis for a Specification Language. 139-156 BibTeX
A. Bijlsma: Transformational Programming and Forests. 157-173 BibTeX
Wei Chen, Jan Tijmen Udding, Tom Verhoeff: Networks of Communicating Processes and Their (De-)Composition. 174-196 BibTeX
Wei Chen, Jan Tijmen Udding: Towards a Calculus of Data Refinement. 197-218 BibTeX
E. Pascal Gribomont: Stepwise Refinement and Concurrency: A Small Exercise. 219-238 BibTeX
John Hannan, Dale Miller: Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional Language. 239-255 BibTeX
Martin C. Henson: Realizability Models for Program Construction. 256-272 BibTeX
Wim H. Hesselink: Initialisation with a Final Value, an Exercise in Program Transformation. 273-280 BibTeX
Anne Kaldewaij, Martin Rem: A Derivation of a Systolic Rank Order Filter with Constant Response Time. 281-296 BibTeX
Anne Kaldewaij, Berry Schoenmakers: Searching by Elimination. 297-306 BibTeX
Christian Lengauer, Jeff W. Sanders: The Projection of Systolic Programs. 307-324 BibTeX
L. D. J. C. Loyens, Rob H. Bisseling: The Formal Construction of a Parallel Triangular System Solver. 325-334 BibTeX
Grant Malcolm: Homomorphisms and Promotability. 335-347 BibTeX
Bernhard Möller: Applicative Assertions. 348-362 BibTeX
Carroll Morgan: Types and Invariants in the Refinement Calculus. 363-378 BibTeX
Douglas R. Smith, Michael R. Lowry: Algorithm Theories and Design Tactics. 379-398 BibTeX
J. Michael Spivey: A Categorial Approch to the Theory of Lists. 399-408 BibTeX
Jaap van der Woude: Rabbitcount : = Rabbitcount - 1. 409-420 BibTeX