Logo

Galois Connections and Fixed Point Calculus

Galois Connections and Fixed Point Calculus
by


Number of pages: 105

Description:
Recursion is a very powerful problem-solving technique that is used widely in computing science. It is used, for example, in the definition of programming languages, as a fundamental programming structure in functional and logic programming, and in the definition of data structures. A complete understanding of recursion can only be achieved by studying its algebraic properties. This tutorial covers fixed point calculus, which is about the solution of recursive equations defined by a monotonic endofunction on a partially ordered set. It 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 presents 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.

Home page url

Download or read it online for free here:
Download link
(0.5MB, PDF)

Similar books

Book cover: Rule-based Computation and DeductionRule-based Computation and Deduction
by - ESSLLI
This text first introduces the concept of rewriting which is behind rule-based systems. Then the rewriting logic and the rewriting calculus are defined and shown to be especially suited to describing concurrent and non-deterministic computations.
(8781 views)
Book cover: Cellular Automata And Complexity: Collected PapersCellular Automata And Complexity: Collected Papers
by - Westview Press
These original papers on cellular automata and complexity provide a highly readable account of what has become a major new field of science, with important implications for computer science, physics, economics, biology, and many other areas.
(13632 views)
Book cover: Introduction to Theory of ComputationIntroduction to Theory of Computation
by - Carleton University
This is a textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.
(9969 views)
Book cover: Introduction to Computing: Explorations in Language, Logic, and MachinesIntroduction to Computing: Explorations in Language, Logic, and Machines
by - University of Virginia
An introduction to the most important ideas in computing. It focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the limits of what can be computed mechanically.
(14025 views)