程序构造用数学/Mathematics of program construction
点此进入淘宝搜索页搜索分類: 图书,计算机/网络,数据库,数据库理论,
作者： Tarmo Uustalu著
出 版 社： 湖北辞书出版社
出版时间： 2006-12-1字数：版次： 1页数： 454印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540356318包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS including its subseries LNAI spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）
内容简介
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, co-located with AMAST 2006, the 11th International Conference on Algebraic Methodology and Software Technology. The 22 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 45 submissions. 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.
目录
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
Author Index
