Galois Connections and Fixed Point Calculus Export

@inbook{Backhouse02, abstract = {Fixed point calculus is about the solution of recursive equations defined by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of fixed point calculus together with a number of applications of direct relevance to the construction of computer programs. The tutorial also summarises the theory and application of Galois connections between partially ordered sets. In particular, the intimate relation between Galois connections and fixed point equations is amply demonstrated.}, author = {Backhouse, Roland}, booktitle = {Lecture Notes in Computer Science}, chapter = {4}, citeulike-article-id = {2323310}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-47797-7_4}, citeulike-linkout-1 = {http://www.springerlink.com/content/0bv6u7nmadl3lemd}, citeulike-linkout-2 = {http://www.cs.nott.ac.uk/~rcb/G53PAL/FPandGC.pdf}, doi = {10.1007/3-540-47797-7_4}, editor = {Backhouse, Roland and Crole, Roy and Gibbons, Jeremy}, isbn = {978-3-540-43613-3}, journal = {Algebraic and Coalgebraic Methods in the Mathematics of Program Construction}, keywords = {2002, fixed-point, galois-connection, mathematics, partial-order, set-theory, theory, tutorial}, pages = {89--150}, posted-at = {2009-09-01 11:46:21}, priority = {2}, publisher = {Springer Berlin / Heidelberg}, series = {Lecture Notes in Computer Science}, title = {Galois Connections and Fixed Point Calculus}, url = {http://dx.doi.org/10.1007/3-540-47797-7_4}, volume = {2297}, year = {2002} }

TY - CHAP ID - Backhouse02 L3 - citeulike-article-id:2323310 N2 - Fixed point calculus is about the solution of recursive equations defined by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of fixed point calculus together with a number of applications of direct relevance to the construction of computer programs. The tutorial also summarises the theory and application of Galois connections between partially ordered sets. In particular, the intimate relation between Galois connections and fixed point equations is amply demonstrated. JF - Algebraic and Coalgebraic Methods in the Mathematics of Program Construction SE - Lecture Notes in Computer Science SN - 978-3-540-43613-3 EP - 150 TI - Galois Connections and Fixed Point Calculus PB - Springer Berlin / Heidelberg VL - 2297 T2 - Lecture Notes in Computer Science SP - 89 KW - 2002 KW - fixed-point KW - galois-connection KW - mathematics KW - partial-order KW - set-theory KW - theory KW - tutorial AU - Backhouse, Roland A2 - Backhouse, Roland A2 - Crole, Roy A2 - Gibbons, Jeremy PY - 2002/// UR - http://dx.doi.org/10.1007/3-540-47797-7_4 ER -