TY - BOOK
AU - Backhouse,Roland
AU - Crole,Roy
AU - Gibbons,Jeremy
ED - SpringerLink (Online service)
TI - Algebraic and Coalgebraic Methods in the Mathematics of Program Construction: International Summer School and Workshop Oxford, UK, April 10–14, 2000 Revised Lectures
T2 - Lecture Notes in Computer Science,
SN - 9783540477976
AV - QA76.758
U1 - 005.1 23
PY - 2002///
CY - Berlin, Heidelberg
PB - Springer Berlin Heidelberg
KW - Computer science
KW - Software engineering
KW - Programming languages (Electronic computers)
KW - Computers
KW - Computer logic
KW - Mathematical logic
KW - Computer Science
KW - Software Engineering
KW - Theory of Computation
KW - Software Engineering/Programming and Operating Systems
KW - Programming Languages, Compilers, Interpreters
KW - Logics and Meanings of Programs
KW - Mathematical Logic and Formal Languages
N1 - 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
N2 - 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
UR - http://dx.doi.org/10.1007/3-540-47797-7
ER -