FEEDBACK Smiley face
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction International Summer School and Workshop Oxford, UK, April 10–14, 2000 Revised Lectures / [electronic resource] : edited by Roland Backhouse, Roy Crole, Jeremy Gibbons. - XIV, 390 p. online resource. - Lecture Notes in Computer Science, 2297 0302-9743 ; . - Lecture Notes in Computer Science, 2297 .

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.


10.1007/3-540-47797-7 doi

Computer science.
Software engineering.
Programming languages (Electronic 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 Languages.



© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: