Invited Talks -- The Algorithmics of Solitaire-Like Games -- Compositionality of Secure Information Flow -- Process Algebras for Collective Dynamics -- Contributed Talks -- On Automated Program Construction and Verification -- The Logic of Large Enough -- Dependently Typed Grammars -- Abstraction of Object Graphs in Program Verification -- Subtyping, Declaratively -- Compositional Action System Derivation Using Enforced Properties -- Designing an Algorithmic Proof of the Two-Squares Theorem -- Partial, Total and General Correctness -- Unifying Theories of Programming That Distinguish Nontermination and Abort -- Adjoint Folds and Unfolds -- An Abstract Machine for the Old Value Retrieval -- A Tracking Semantics for CSP -- Matrices as Arrows! -- Lucy-n: a n-Synchronous Extension of Lustre -- Sampling, Splitting and Merging in Coinductive Stream Calculus -- Generic Point-free Lenses -- Formal Derivation of Concurrent Garbage Collectors -- Temporal Logic Verification of Lock-Freedom -- Gradual Refinement.

This book constitutes the refereed proceedings of the 10th International Conference on Mathematics of Program Construction, MPC 2010, held in Québec City, Canada in June 2010. The 19 revised full papers presented together with 1 invited talk and the abstracts of 2 invited talks were carefully reviewed and selected from 37 submissions. The focus is on techniques that combine precision with conciseness, enabling programs to be constructed by formal calculation. Within this theme, the scope of the series is very diverse, including programming methodology, program specification and transformation, program analysis, programming paradigms, programming calculi, programming language semantics, security and program logics.