Volume 26,
Numbers 1-3,
May 1996
Mathematics of Program Construction Selected Papers from the Third International Conference on the Mathematics of Program Construction (17-21 July 1995,
Kloster Irsee,
Germany)
- Michel Sintzoff:
Editorial (Selected Papers from the Third International Conference on the Mathematics of Program Construction).
1-2
- Bernhard Möller:
Preface (Selected Papers from the Third International Conference on the Mathematics of Program Construction).
3
- Roland Carl Backhouse:
Mathematics of Program Construction.
5-9
- Wladyslaw M. Turski:
I Was a Computer.
11-14
- Richard S. Bird:
Functional Algorithm Design.
15-31
- Natarajan Shankar:
Steps Toward Mechanizing Program Transformations Using PVS.
33-57
- Klaus Achatz, Wolfram Schulte:
Massive Parallelization of Divide-and-Conquer Algorithms over Powerlists.
59-78
- Ralph-Johan Back, Alain J. Martin, Kaisa Sere:
Specifying the Caltech Asynchronous Microprocessor.
79-97
- Rudolf Berghammer, Burghard von Karger:
Towards a Design Calculus for CSP.
99-115
- Martin Russling:
Deriving a Class of Layer-Oriented Graph Algorithms.
117-132
- Krzysztof R. Apt:
Arrays, Bounded Quantification and Iteration in Logic and Constraing Logic Programming.
133-148
- Anne Kaldewaij, Victor J. Dielissen:
Leaf Trees.
149-165
- Thierry Coquand:
An Algorithm for Type-Checking Dependent Types.
167-177
- Jean-François Monin:
Exceptions Considered Harmless.
179-196
- Sharon Curtis, Gavin Lowe:
Proofs with Graphs.
197-216
- Henk Doornbos, Roland Carl Backhouse:
Reductivity.
217-236
- Marc Frappier, Ali Mili, Jules Desharnais:
A Relational Calculus for Program Construction by Parts.
237-254
- Ketil Stølen:
Refinement Principles Supporting the Transition from Asynchronous to Synchronous Communication.
255-272
Copyright © Wed Nov 25 19:12:57 2009
by Michael Ley (ley@uni-trier.de)
