Algebraic and Coalgebraic Methods in the Mathematics of Program Construction : International Summer School and Workshop, Oxford, UK, April 10-14, 2000 : revised lectures

Author(s)

Bibliographic Information

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.)

(Lecture notes in computer science, 2297)

Springer, c2002

Available at  / 33 libraries

Search this Book/Journal

Note

Includes bibliographical references and index

"Tutorial"--cover

Description and Table of Contents

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.

Table of Contents

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.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BA56628479
  • ISBN
    • 3540436138
  • LCCN
    01031130
  • Country Code
    gw
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Berlin
  • Pages/Volumes
    xiv, 385 p.
  • Size
    24 cm
  • Parent Bibliography ID
Page Top