Galois Connections and Fixed Point Calculus

Authors:
Roland Carl Backhouse
Affiliations:
-
Venue:
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Year:
2000

Citing 8
Cited 4

Exercises in formula manipulation

Formal development programs and proofs
Predicate calculus and program semantics

Predicate calculus and program semantics
Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
An axiomatic basis for computer programming

Communications of the ACM
Report on the algorithmic language ALGOL 60

Communications of the ACM
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Constructing Tournament Representations: An Exercise in Pointwise Relational Programming

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
An Exercise on Transition Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Proof Techniques for Adapter Generation

Web Services and Formal Methods
CPS-translation as adjoint

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

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.