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
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Type inference for datalog and its application to query optimisation
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fixed point semantics and partial recursion in Coq
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Calculating Invariants as Coreflexive Bisimulations
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
The worker/wrapper transformation
Journal of Functional Programming
Algebra of programming in agda: Dependent types for relational program derivation
Journal of Functional Programming
On the structure of demonic refinement algebras with enabledness and termination
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Constructing replaceable services using operating guidelines and maximal controllers
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Programming from galois connections
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Behavior based service composition
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Calculating graph algorithms for dominance and shortest path
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
| Hi-index | 0.00 |
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.