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.
Algebraic and Coalgebraic Methods in the Mathematics of P...
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
This volume is an up-to-date introduction to developments in the calculational construction of computer programs, with particular emphasis on the use of algebraic and coalgebraic datatypes. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
admitting induction, sequential algebra, least prefix point, binary tree spaces, coalgebraic specification, tail recursion rule, upper adjoint, indirect equality, lower adjoint, monotone endofunction, pair calculus, shunting rule, fixed point calculus, coalgebraic setting, coalgebraic methods, polymorphic datatypes, fusion theorem, unique extension property, polynomial functor, bracketing problem, temporal algebra, prefix points, converse operator, prefixed point, supremum operator Key Phrases - Capitalized Phrases (CAPs): (learn more)
Greedy Theorem, Roland Backhouse, Springer-Verlag Berlin Heidelberg, Mini-exercise Let, Cambridge University Press, Paul Hoogendijk, Algebraic Definition, Electronic Notes, List Val, Thinning Theorem, Zorn's Lemma, Connecting Lemma, Eindhoven University of Technology, International Conference, Philip Wadler, Programming Research Group, Formal Program Development, Graham Hutton, Grant Malcolm, Information Processing Letters, Oxford University Computing Laboratory, Prentice Hall, Science of Computer Programming, University of Oxford Abstract New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
This volume is an up-to-date introduction to developments in the calculational construction of computer programs, with particular emphasis on the use of algebraic and coalgebraic datatypes. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
admitting induction, sequential algebra, least prefix point, binary tree spaces, coalgebraic specification, tail recursion rule, upper adjoint, indirect equality, lower adjoint, monotone endofunction, pair calculus, shunting rule, fixed point calculus, coalgebraic setting, coalgebraic methods, polymorphic datatypes, fusion theorem, unique extension property, polynomial functor, bracketing problem, temporal algebra, prefix points, converse operator, prefixed point, supremum operator Key Phrases - Capitalized Phrases (CAPs): (learn more)
Greedy Theorem, Roland Backhouse, Springer-Verlag Berlin Heidelberg, Mini-exercise Let, Cambridge University Press, Paul Hoogendijk, Algebraic Definition, Electronic Notes, List Val, Thinning Theorem, Zorn's Lemma, Connecting Lemma, Eindhoven University of Technology, International Conference, Philip Wadler, Programming Research Group, Formal Program Development, Graham Hutton, Grant Malcolm, Information Processing Letters, Oxford University Computing Laboratory, Prentice Hall, Science of Computer Programming, University of Oxford Abstract New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 65
books:
See all 65 books this book cites
- Introduction to Lattices and Order by B. A. Davey on page 147, page 195, and page 278
- Computer Science by Richard Jones on page 195, page 278, and page 307
- Categories, Allegories, Volume 39 (North-Holland Mathematical Library) by P.J. Freyd on page 19, page 234, and page 307
- Algebraic Methodology and Software Technology: 8th International Conference, AMAST 2000 Iowa City, Iowa, USA, May 20-27, 2000 Proceedings (Lecture Notes in Computer Science) by Teodor Rus on page 234, page 278, and page 307
- Categories for the Working Mathematician (Graduate Texts in Mathematics) by Saunders Mac Lane on page 19, page 78, and page 195
See all 65 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Software Engineering > Methodology
- Books > Computers & Technology > Programming > Languages & Tools
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Software Development
- Books > Medical Books
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Computer Science > Software Design & Engineering
- Books > New & Used Textbooks > Medicine & Health Sciences > Medicine > General
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Science & Math > Mathematics
