3. MPC 1995: Kloster Irsee, Germany

@proceedings{DBLP:conf/mpc/1995,
  editor    = {Bernhard M{\"o}ller},
  title     = {Mathematics of Program Construction, MPC'95, Kloster Irsee, Germany,
               July 17-21, 1995, Proceedings},
  booktitle = {MPC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {947},
  year      = {1995},
  isbn      = {3-540-60117-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

• Krzysztof R. Apt: Towards Automatic Parallelization of Logic Programs (Abstract). 1
• Richard S. Bird: Functional Algorithm Design. 2-17
• Manfred Broy: Mathematics of Software Engineering. 18-48
• Thierry Coquand: Program Construction in Intuitionistic Type Theory (Abstract). 49
• Natarajan Shankar: Computer-Aided Computing. 50-66

Contributed Lectures

• Ali E. Abdallah: Derivation of Parallel Algorithms from Functional Specifications to CSP Processes. 67-96
• Klaus Achatz, Wolfram Schulte: Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms. 97-127
• Ralph-Johan Back, Michael J. Butler: Exploring Summation and Product Operators in the Refinement Calculus. 128-158
• Ralph-Johan Back, Alain J. Martin, Kaisa Sere: An Action System Specification of the Caltech Asynchronous Microprocessor. 159-179
• Rudolf Berghammer, Burghard von Karger: Formal Derivation of CSP Programs From Temporal Specifications. 181-196
• Frank S. de Boer, M. van Hulst: A Compositional Proof System for Asynchronously Communicating Processes. 197-213
• Sharon Curtis, Gavin Lowe: A Graphical Calculus. 214-231
• Victor J. Dielissen, Anne Kaldewaij: A Simple, Efficient, and Flexible Implementation of Flexible Arrays. 232-241
• Henk Doornbos, Roland Carl Backhouse: Induction and Recursion on Datatypes. 242-256
• Marc Frappier, Ali Mili, Jules Desharnais: Program Construction by Parts. 257-281
• Jeremy Gibbons: An Initial-Algebra Approach to Directed Acyclic Graphs. 282-303
• Rix Groenboom, Chris Hendriks, Indra Polak, Jan Terlouw, Jan Tijmen Udding: Algebraic Proof Assistants in HOL. 304-321
• Wim H. Hesselink: Angelic Termination in Dijkstra`s Calculus. 322-334
• Jean-François Monin: Extracting Programs with Exceptions in an Impredicative Type System. 335-350
• Catherine Parent: Synthesizing Proofs from Programs in the Calculus of Inductive Constructions. 351-379
• Martin Russling: A General Scheme for Breadth-First Graph Traversal. 380-398
• Yellamraju V. Srinivas, Richard Jüllig: Specware: Formal Support for Composing Software. 399-422
• Ketil Stølen: A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication Buffers. 423-451
• Rob T. Udink, Joost N. Kok: ImpUNITY: UNITY with Procedures and Local Variables. 452-472