Algebraic and coalgebraic methods in the mathematics of program construction
Subtitle: international summer school and workshop Oxford, UK, April 10-14, 2000, revised lectures
By: Roland Backhouse, Roy Crole, Jeremy Gibbons, eds.
Contributors: Backhouse, Roland C., 1948-; Crole, Roy L.; Gibbons, Jeremy, 1966-
Series: Lecture notes in computer science -- 2297.
Publisher: Springer
Published: 2002
Place of publication: New York
Language: eng
Number of pages: 385
Subjects: Computer programming -- Congresses; Computer science -- Mathematics -- Congresses; Algebra -- Congresses
Genres: Congresses.
Description: 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.
Notes: Includes bibliographical references and index.