1 option
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction : International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures / edited by Roland Backhouse, Roy Crole, Jeremy Gibbons.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2297.
- Lecture Notes in Computer Science, 0302-9743 ; 2297
- Language:
- English
- Subjects (All):
- Software engineering.
- Computers.
- Programming languages (Electronic computers).
- Computer logic.
- Logic, Symbolic and mathematical.
- 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.
- Local Subjects:
- 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.
- Physical Description:
- 1 online resource (XIV, 390 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- Summary:
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-47797-6
- 9783540477976
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.