Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2297)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (9 chapters)
-
Front Matter
-
Back Matter
About this book
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
Book Title: Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Book Subtitle: International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures
Editors: Roland Backhouse, Roy Crole, Jeremy Gibbons
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-47797-7
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2002
Softcover ISBN: 978-3-540-43613-3Published: 17 April 2002
eBook ISBN: 978-3-540-47797-6Published: 31 July 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIV, 390
Topics: Software Engineering, Theory of Computation, Software Engineering/Programming and Operating Systems, Programming Languages, Compilers, Interpreters, Logics and Meanings of Programs, Mathematical Logic and Formal Languages