Mathematics of Program Construction
8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings
Published on 27. June 2006
Book
Paperback/Softback
X, 458 pages
978-3-540-35631-8 (ISBN)
Description
This book constitutes the refereed proceedings of the 8th International Conference on Mathematics of Program Construction, MPC 2006, held in Kuressaare, Estonia in July 2006. The book collects 22 revised full papers presented with 3 invited talks. Issues addressed range from algorithmics to support for program construction in programming languages and systems. Topics of special interest are type systems, program analysis and transformation, programming language semantics, program logics.
More details
Series
Edition
2006 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 458 p.
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
1440 gr
ISBN-13
978-3-540-35631-8 (9783540356318)
DOI
10.1007/11783596
Schweitzer Classification
Content
Invited Talks.- What Is a Good Process Semantics?.- Refunctionalization at Work.- Aspects and Data Refinement.- Contributed Papers.- Towards Generic Programming with Sized Types.- Relational Semantics for Higher-Order Programs.- Proofs of Randomized Algorithms in Coq.- Exercises in Quantifier Manipulation.- Improving Saddleback Search: A Lesson in Algorithm Design.- Loopless Functional Algorithms.- Compositional Reasoning for Pointer Structures.- Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guards.- Fission for Program Comprehension.- "Scrap Your Boilerplate" Revolutions.- Generic Views on Data Types.- Recursion Schemes for Dynamic Programming.- Bimonadic Semantics for Basic Pattern Matching Calculi.- Nondeterministic Folds.- A Datastructure for Iterated Powers.- Continuous Action System Refinement.- The Linear Algebra of UTP.- The Shadow Knows: Refinement of Ignorance in Sequential Programs.- Swapping Arguments and Results of Recursive Functions.- Refinement Algebra with Operators for Enabledness and Termination.- Constructing Rewrite-Based Decision Procedures for Embeddings and Termination.- Quantum Predicative Programming.