Galois Connections and Fixed Point Calculus | Zendy

Roland Backhouse | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Galois Connections and Fixed Point Calculus

Author(s) -

Roland Backhouse

Publication year - 2002

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-43613-8

DOI - 10.1007/3-540-47797-7_4

Subject(s) - fixed point , computer science , monotonic function , calculus (dental) , relation (database) , fixed point theorem , least fixed point , point (geometry) , algebra over a field , mathematics , discrete mathematics , pure mathematics , mathematical analysis , schauder fixed point theorem , medicine , dentistry , geometry , database , picard–lindelöf theorem

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research