Amazon cover image
Image from Amazon.com

Algebraic and coalgebraic methods in the mathematics of program construction : international summer school and workshop Oxford, UK, April 10-14, 2000, revised lectures / Roland Backhouse, Roy Crole, Jeremy Gibbons, eds.

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 2297.Publication details: Berlin ; New York : Springer, ©2002.Description: 1 online resource (xiv, 385 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540477976
  • 3540477977
Subject(s): Genre/Form: Additional physical formats: Print version:School on Algebraic and Co-algebraic Methods in the Mathematics of Program Construction (2000 : University of Oxford): Algebraic and coalgebraic methods in the mathematics of program construction : international summer school and workshop Oxford, UK, April 10-14, 2000, revised lecturesDDC classification:
  • 005 21
LOC classification:
  • QA76.6 .S415 2000
Other classification:
  • PN 411
Online resources:
Contents:
Ordered sets and complete lattices / Hilary A. Priestley -- Algebras and coalgebras / Peter Aczel -- Galois connections and fixed point calculus / Roland Backhouse -- Calculating functional programs / Jeremy Gibbons -- Algebra of program termination / Henk Doornbos and Roland Backhouse -- Exercises in coalgebraic specification / Bart Jacobs -- Algebraic methods for optimization problems / Richard Bird, Jeremy Gibbons, and Shin-Cheng Mu -- Temporal algebra / Burghard von Karger.
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references and index.

Ordered sets and complete lattices / Hilary A. Priestley -- Algebras and coalgebras / Peter Aczel -- Galois connections and fixed point calculus / Roland Backhouse -- Calculating functional programs / Jeremy Gibbons -- Algebra of program termination / Henk Doornbos and Roland Backhouse -- Exercises in coalgebraic specification / Bart Jacobs -- Algebraic methods for optimization problems / Richard Bird, Jeremy Gibbons, and Shin-Cheng Mu -- Temporal algebra / Burghard von Karger.

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.

English.

Powered by Koha