Abstract is missing.
- On the Aesthetics of Diagrams (Summary of Talk)David Harel. 1-5 [doi]
- Generalising Monads (Abstract)John Hughes. 6
- A Proof Rule for Control LoopsBurghard von Karger. 7-22 [doi]
- Relation-Algebraic Derivation of Spanning Tree AlgorithmsRudolf Berghammer, Burghard von Karger, Andreas Wolf. 23-43 [doi]
- An Application of Program Derivation Techniques to 18th-Century MathematicsA. Bijlsma. 44-51 [doi]
- Nested DatatypesRichard S. Bird, Lambert G. L. T. Meertens. 52-67 [doi]
- An Approach to Object-Orientation in Action SystemsMarcello M. Bonsangue, Joost N. Kok, Kaisa Sere. 68-95 [doi]
- Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic ApproachThomas Brunn, Bernhard Möller, Martin Russling. 96-121 [doi]
- A Unifying Framework for Correct Program ConstructionHenning Dierks, Michael Schenke. 122-150 [doi]
- Computation Calculus - Bridging a Formalization GapRutger M. Dijkstra. 151-174 [doi]
- An Elementary Derivation of the Alternating Bit ProtocolW. H. J. Feijen, A. J. M. van Gasteren, Birgit Schieder. 175-187 [doi]
- A Set-Theoretic Model for Real-Time Specification and ReasoningColin J. Fidge, Ian J. Hayes, A. P. Martin, Axel Wabenhorst. 188-206 [doi]
- Polytypic Downwards AccumulationsJeremy Gibbons. 207-233 [doi]
- Formal Derivation of a Loadable Asynchronous CounterMark B. Josephs. 234-253 [doi]
- A Semantic Approach to Secure Information FlowK. Rustan M. Leino, Rajeev Joshi. 254-271 [doi]
- Slack Elasticity in Concurrent ComputingRajit Manohar, Alain J. Martin. 272-285 [doi]
- Beyond Fun: Order and Membership in Polytypic Imperative ProgrammingDavid A. Naumann. 286-314 [doi]
- Convergence of Program Transformers in the Metric Space of TreesMorten Heine Sørensen. 315-337 [doi]
- Realizability of Monotone Coinductive Definitions and Its Application to Program SynthesisMakoto Tatsuta. 338-364 [doi]
- Calculating a Round-Robin SchedulerMatteo Vaccari, Roland Carl Backhouse. 365-382 [doi]