Skip to main content
SpringerLink
Log in

Mathematics of Program Construction

Third International Conference, MPC '95, Kloster Irsee, Germany, July 17 - 21, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Bernhard Möller
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 947)

Included in the following conference series:

Conference proceedings info: MPC 1995.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. Towards automatic parallelization of logic programs

    • Krzysztof R. Apt
    Pages 1-1

  3. Functional Algorithm Design

    • Richard S. Bird
    Pages 2-17

  4. Mathematics of software engineering

    • Manfred Broy
    Pages 18-48

  5. Program construction in intuitionistic Type Theory

    • Thierry Coquand
    Pages 49-49

  6. Computer-aided computing

    • Natarajan Shankar
    Pages 50-66

  7. Derivation of parallel algorithms from functional specifications to CSP processes

    • Ali E. Abdallah
    Pages 67-96

  8. Architecture independent massive parallelization of divide-and-conquer algorithms

    • Klaus Achatz, Wolfram Schulte
    Pages 97-127

  9. Exploring summation and product operators in the refinement calculus

    • Ralph-Johan Back, Michael Butler
    Pages 128-158

  10. An action system specification of the caltech asynchronous microprocessor

    • R. J. R. Back, A. J. Martin, K. Sere
    Pages 159-179

  11. Formal derivation of CSP programs from temporal specifications

    • Rudolf Berghammer, Burghard von Karger
    Pages 180-196

  12. A compositional proof system for asynchronously communicating processes

    • F. S. de Boer, M. van Hulst
    Pages 197-213

  13. A graphical calculus

    • Sharon Curtis, Gavin Lowe
    Pages 214-231

  14. A simple, efficient, and flexible implementation of flexible arrays

    • Victor J. Dielissen, Anne Kaldewaij
    Pages 232-241

  15. Induction and recursion on datatypes

    • Henk Doornbos, Roland Backhouse
    Pages 242-256

  16. Program construction by parts

    • M. Frappier, A. Mili, J. Desharnais
    Pages 257-281

  17. An initial-algebra approach to directed acyclic graphs

    • Jeremy Gibbons
    Pages 282-303

  18. Algebraic proof assistants in HOL

    • Rix Groenboom, Chris Hendriks, Indra Polak, Jan Terlouw, Jan Tijmen Udding
    Pages 304-321

  19. Angelic termination in Dijkstra's calculus

    • Wim H. Hesselink
    Pages 322-334

  20. Extracting programs with exceptions in an impredicative type system

    • Jean-François Monin
    Pages 335-350
Back to top

Other volumes

  1. Mathematics of Program Construction

Keywords

About this book

This volume constitutes the proceedings of the Third International Conference on the Mathematics of Program Construction, held at Kloster Irsee, Germany in July 1995.
Besides five invited lectures by distinguished researchers there are presented 19 full revised papers selected from a total of 58 submissions. The general theme is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; among the topics addressed are program transformation, program analysis, program verification, as well as convincing case studies.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation