§15§ §04§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.- Refi §04§nement Algebra with Operators for Enabledness and Termination.- Constructing Rewrite-Based Decision Procedures for Embeddings and Termination.- Quantum Predicative Programming.
