Abstract is missing.
- Towards Automatic Parallelization of Logic Programs (Abstract)Krzysztof R. Apt. 1
- Functional Algorithm DesignRichard S. Bird. 2-17
- Mathematics of Software EngineeringManfred Broy. 18-48
- Program Construction in Intuitionistic Type Theory (Abstract)Thierry Coquand. 49
- Computer-Aided ComputingNatarajan Shankar. 50-66
- Derivation of Parallel Algorithms from Functional Specifications to CSP ProcessesAli E. Abdallah. 67-96
- Architecture Independent Massive Parallelization of Divide-and-Conquer AlgorithmsKlaus Achatz, Wolfram Schulte. 97-127
- Exploring Summation and Product Operators in the Refinement CalculusRalph-Johan Back, Michael J. Butler. 128-158
- An Action System Specification of the Caltech Asynchronous MicroprocessorRalph-Johan Back, Alain J. Martin, Kaisa Sere. 159-179
- Formal Derivation of CSP Programs From Temporal SpecificationsRudolf Berghammer, Burghard von Karger. 181-196
- A Compositional Proof System for Asynchronously Communicating ProcessesFrank S. de Boer, M. van Hulst. 197-213
- A Graphical CalculusSharon Curtis, Gavin Lowe. 214-231
- A Simple, Efficient, and Flexible Implementation of Flexible ArraysVictor J. Dielissen, Anne Kaldewaij. 232-241
- Induction and Recursion on DatatypesHenk Doornbos, Roland Carl Backhouse. 242-256
- Program Construction by PartsMarc Frappier, Ali Mili, Jules Desharnais. 257-281
- An Initial-Algebra Approach to Directed Acyclic GraphsJeremy Gibbons. 282-303
- Algebraic Proof Assistants in HOLRix Groenboom, Chris Hendriks, Indra Polak, Jan Terlouw, Jan Tijmen Udding. 304-321
- Angelic Termination in Dijkstra s CalculusWim H. Hesselink. 322-334
- Extracting Programs with Exceptions in an Impredicative Type SystemJean-François Monin. 335-350
- Synthesizing Proofs from Programs in the Calculus of Inductive ConstructionsCatherine Parent. 351-379
- A General Scheme for Breadth-First Graph TraversalMartin Russling. 380-398
- Specware: Formal Support for Composing SoftwareYellamraju V. Srinivas, Richard Jüllig. 399-422
- A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication BuffersKetil Stølen. 423-451
- ImpUNITY: UNITY with Procedures and Local VariablesRob T. Udink, Joost N. Kok. 452-472