default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th MPC 1998: Marstrand, Sweden
- Johan Jeuring:
Mathematics of Program Construction, MPC'98, Marstrand, Sweden, June 15-17, 1998, Proceedings. Lecture Notes in Computer Science 1422, Springer 1998, ISBN 3-540-64591-8
Invited Lectures
- David Harel:
On the Aesthetics of Diagrams (Summary of Talk). 1-5 - John Hughes:
Generalising Monads (Abstract). 6 - Burghard von Karger:
A Proof Rule for Control Loops. 7-22
Contributed Lectures
- Rudolf Berghammer, Burghard von Karger, Andreas Wolf:
Relation-Algebraic Derivation of Spanning Tree Algorithms. 23-43 - A. Bijlsma:
An Application of Program Derivation Techniques to 18th-Century Mathematics. 44-51 - Richard S. Bird, Lambert G. L. T. Meertens:
Nested Datatypes. 52-67 - Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere:
An Approach to Object-Orientation in Action Systems. 68-95 - Thomas Brunn, Bernhard Möller, Martin Russling:
Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach. 96-121 - Henning Dierks, Michael Schenke:
A Unifying Framework for Correct Program Construction. 122-150 - Rutger M. Dijkstra:
Computation Calculus - Bridging a Formalization Gap. 151-174 - W. H. J. Feijen, A. J. M. van Gasteren, Birgit Schieder:
An Elementary Derivation of the Alternating Bit Protocol. 175-187 - Colin J. Fidge, Ian J. Hayes
, Andrew P. Martin, Axel Wabenhorst:
A Set-Theoretic Model for Real-Time Specification and Reasoning. 188-206 - Jeremy Gibbons:
Polytypic Downwards Accumulations. 207-233 - Mark B. Josephs:
Formal Derivation of a Loadable Asynchronous Counter. 234-253 - K. Rustan M. Leino, Rajeev Joshi:
A Semantic Approach to Secure Information Flow. 254-271 - Rajit Manohar, Alain J. Martin:
Slack Elasticity in Concurrent Computing. 272-285 - David A. Naumann:
Beyond Fun: Order and Membership in Polytypic Imperative Programming. 286-314 - Morten Heine Sørensen:
Convergence of Program Transformers in the Metric Space of Trees. 315-337 - Makoto Tatsuta:
Realizability of Monotone Coinductive Definitions and Its Application to Program Synthesis. 338-364 - Matteo Vaccari, Roland Carl Backhouse:
Calculating a Round-Robin Scheduler. 365-382
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-07 00:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
