Program Derivation By Fixed Point Computation

Fixed Points: Algorithms and Applications covers the proceedings of the First International Conference on Computing Fixed Points with Applications, held in the Department of Mathematical Sciences at Clemson University, Clemson, South Carolina on June 26-28, 1974. This book is composed of 21 chapters and starts with reviews of finding roots of polynomials by pivoting procedures and the relations between convergence and labeling in approximation algorithm. The next chapters deal with the principles of complementary pivot theory and the Markovian decision chains; the method of continuation for Brouwer fixed point calculation; a fixed point approach to stability in cooperative games; and computation of fixed points in a nonconvex region. Other chapters discuss a computational comparison of fixed point algorithms, the fundamentals of union jack triangulations, and some aspects of Mann’s iterative method for approximating fixed points. The final chapters consider the application of fixed point algorithms to the analysis of tax policies and the pricing for congestion in telephone networks. This book will prove useful to mathematicians, computer scientists, and advance mathematics students.

This book constitutes the refereed proceedings of the 11th International Conference on Mathematics of Program Construction, MPC 2012, held in Madrid, Spain, in June 2012. The 13 revised full papers presented together with three invited talks were carefully reviewed and selected from 27 submissions. The papers are organized in topical sections on security and information flow, synchronous and real-time systems, algorithms and games, program calculi, tool support, algebras and datatypes, and categorical functional programming.

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.

This book constitutes the refereed proceedings of the 6th International Conference on Mathematics of Program Construction, MPC 2002, held in Dagstuhl Castle, Germany, in July 2002. The 11 revised full papers presented were carefully reviewed and selected for inclusion in the book; also presented are one invited paper and the abstracts of two invited talks. Among the topics covered are programming methodology, program specification, program transformation, programming paradigms, programming calculi, and programming language semantics.

This work, a tribute to renowned researcher Robert Paige, is a collection of revised papers published in his honor in the Higher-Order and Symbolic Computation Journal in 2003 and 2005. Among them there are two key papers: a retrospective view of his research lines, and a proposal for future studies in the area of the automatic program derivation. The book also includes some papers by members of the IFIP Working Group 2.1 of which Bob was an active member.

This volume constitutes the proceedings of the First International Conference on Constraints in Computational Logics, CCL '94, held in Munich, Germany in September 1994. Besides abstracts or full papers of the 5 invited talks by senior researchers, the book contains revised versions of the 21 accepted research papers selected from a total of 52 submissions. The volume assembles high quality original papers covering major theoretical and practical issues of combining and extending programming paradigms, preferably by using constraints. The topics covered include symbolic constraints, set constraints, numerical constraints, multi-paradigm programming, combined calculi, constraints in rewriting, deduction, symbolic computations, and working systems.

An introduction to simple type theory, containing 200 exercises with complete solutions.

Optimal Solution of Nonlinear Equations is a text/monograph designed to provide an overview of optimal computational methods for the solution of nonlinear equations, fixed points of contractive and noncontractive mapping, and for the computation of the topological degree. It is of interest to any reader working in the area of Information-Based Complexity. The worst-case settings are analyzed here. Several classes of functions are studied with special emphasis on tight complexity bounds and methods which are close to or achieve these bounds. Each chapter ends with exercises, including companies and open-ended research based exercises.