Mathematics of Program Construction 4th International Conference, MPC'98, Marstrand, Sweden, June 15-17, 1998, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Jeuring, Johan (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
• Έκδοση: 1st ed. 1998.
• Σειρά: Lecture Notes in Computer Science, 1422
• Θέματα: Computers.; Software engineering.; Computer programming.; Algorithms.; Computer logic.; Theory of Computation.; Software Engineering/Programming and Operating Systems.; Programming Techniques.; Software Engineering.; Algorithm Analysis and Problem Complexity.; Logics and Meanings of Programs.

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...

Πίνακας περιεχομένων:

• 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.