Algebraic and Coalgebraic Methods in the Mathematics of Program Construction [electronic resource] :International Summer School and Workshop Oxford, UK, April 10–14, 2000 Revised Lectures /
Contributor(s): Backhouse, Roland [editor.] | Crole, Roy [editor.] | Gibbons, Jeremy [editor.] | SpringerLink (Online service).Material type: BookSeries: Lecture Notes in Computer Science: 2297Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002.Description: XIV, 390 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540477976.Subject(s): Computer science | Software engineering | Programming languages (Electronic computers) | Computers | Computer logic | Mathematical logic | Computer Science | Software Engineering | Theory of Computation | Software Engineering/Programming and Operating Systems | Programming Languages, Compilers, Interpreters | Logics and Meanings of Programs | Mathematical Logic and Formal LanguagesOnline resources: Click here to access online
Ordered Sets and Complete Lattices -- Algebras and Coalgebras -- Galois Connections and Fixed Point Calculus -- Calculating Functional Programs -- Algebra of Program Termination -- Exercises in Coalgebraic Specification -- Algebraic Methods for Optimization Problems -- Temporal Algebra.
Program construction is about turning specifications of computer software into implementations. Recent research aimed at improving the process of program construction exploits insights from abstract algebraic tools such as lattice theory, fixpoint calculus, universal algebra, category theory, and allegory theory. This textbook-like tutorial presents, besides an introduction, eight coherently written chapters by leading authorities on ordered sets and complete lattices, algebras and coalgebras, Galois connections and fixed point calculus, calculating functional programs, algebra of program termination, exercises in coalgebraic specification, algebraic methods for optimization problems, and temporal algebra.