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

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 al...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Backhouse, Roland (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Crole, Roy (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Gibbons, Jeremy (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Έκδοση:1st ed. 2002.
Σειρά:Lecture Notes in Computer Science, 2297
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Περιγραφή
Περίληψη: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.
Φυσική περιγραφή:XIV, 390 p. online resource.
ISBN:9783540477976
ISSN:0302-9743 ;
DOI:10.1007/3-540-47797-7