Mathematics of program construction : 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006 : proceedings
Author(s)
Bibliographic Information
Mathematics of program construction : 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006 : proceedings
(Lecture notes in computer science, 4014)
Springer, c2006
Available at 10 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references and index
Description and Table of Contents
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.
Table of Contents
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.
by "Nielsen BookData"