Robin Cockett (auth.), Tarmo Uustalu (eds.)3540356312, 9783540356318
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.
Table of contents :
Front Matter….Pages –
What Is a Good Process Semantics?….Pages 1-3
Refunctionalization at Work….Pages 4-4
Aspects and Data Refinement….Pages 5-9
Towards Generic Programming with Sized Types….Pages 10-28
Relational Semantics for Higher-Order Programs….Pages 29-48
Proofs of Randomized Algorithms in Co q ….Pages 49-68
Exercises in Quantifier Manipulation….Pages 69-81
Improving Saddleback Search: A Lesson in Algorithm Design….Pages 82-89
Loopless Functional Algorithms….Pages 90-114
Compositional Reasoning for Pointer Structures….Pages 115-139
Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guards….Pages 140-161
Fission for Program Comprehension….Pages 162-179
“Scrap Your Boilerplate” Revolutions….Pages 180-208
Generic Views on Data Types….Pages 209-234
Recursion Schemes for Dynamic Programming….Pages 235-252
Bimonadic Semantics for Basic Pattern Matching Calculi….Pages 253-273
Nondeterministic Folds….Pages 274-298
A Datastructure for Iterated Powers….Pages 299-315
Continuous Action System Refinement….Pages 316-337
The Linear Algebra of UTP….Pages 338-358
The Shadow Knows: Refinement of Ignorance in Sequential Programs….Pages 359-378
Swapping Arguments and Results of Recursive Functions….Pages 379-396
Refinement Algebra with Operators for Enabledness and Termination….Pages 397-415
Constructing Rewrite-Based Decision Procedures for Embeddings and Termination….Pages 416-432
Quantum Predicative Programming….Pages 433-454
Back Matter….Pages –
Reviews
There are no reviews yet.