Skip to main content
Book cover

Algebraic and Coalgebraic Methods in the Mathematics of Program Construction

International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures

  • Textbook
  • © 2002

Overview

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2297)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 chapters)

Keywords

About this book

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.

Editors and Affiliations

  • School of Computer Science and IT, University of Nottingham, Nottingham, UK

    Roland Backhouse

  • Dept. of Mathematics and Computer Science, University of Leicester, Leicester, UK

    Roy Crole

  • Oxford University Computing Laboratory, Oxford, UK

    Jeremy Gibbons

Bibliographic Information

Publish with us