Algebraic and Coalgebraic Methods in the Mathematics of Program Construction [electronic resource] : International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures /

Contributor(s):

Material type: Text

TextSeries: Lecture Notes in Computer Science ; 2297Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002Edition: 1st ed. 2002Description: XIV, 390 p. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783540477976

Subject(s):

Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:

005.1 23

LOC classification:

QA76.758

Online resources:

Click here to access online

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.

In: Springer Nature eBookSummary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

No physical items for this record

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.

There are no comments on this title.

to post a comment.