Mathematics of program construction : 4th international conference, MPC '98, Marstrand, Sweden, June 15-17, 1998 : proceedings

This book consitutes the refereed proceedings of the 4th International Conference on Mathematics of Program Construction, MPC'98, held in Marstrand, near Goteborg, Sweden, in June 1998. The 17 revised full papers presented were selected from 57 submissions; also included are three invited contr...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Korporativna značnica: International conference on Mathematics of program construction :Marstrand, Suède
Drugi avtorji: Jeuring, Johan, 1965- (Directeur de la publication)
Format: Livre numérique
Jezik:Anglais
Izdano: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Serija:Lecture notes in computer science 1422
Teme:
Online dostop:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Sporočilo: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Mathematics of program construction, 4th international conference, MPC '98, Marstrand, Sweden, June 15-17, 1998, proceedings, Johan Jeuring, ed., 1998, New York, Springer, 1 vol. (X-382 p.), Lecture notes in computer science, 3-540-64591-8
• Mathematics of Program Construction, Texte imprimé, 9783662200797
Kazalo:
  • On the aesthetics of diagrams
  • Generalising monads
  • A proof rule for control loops
  • Relation-algebraic derivation of spanning tree algorithms
  • An application of program derivation techniques to 18th-century mathematics
  • Nested datatypes
  • An approach to object-orientation in action systems
  • Layered graph traversals and Hamiltonian path problems An algebraic approach
  • A unifying framework for correct program construction
  • Computation calculus bridging a formalization gap
  • An elementary derivation of the alternating bit protocol
  • A set-theoretic model for real-time specification and reasoning
  • Polytypic downwards accumulations
  • Formal derivation of a loadable asynchronous counter
  • A semantic approach to secure information flow
  • Slack elasticity in concurrent computing
  • Beyond fun: Order and membership in polytypic imperative programming
  • Convergence of program transformers in the metric space of trees
  • Realizability of monotone coinductive definitions and its application to program synthesis
  • Calculating a round-robin scheduler.