**Galois Connections and Fixed Point Calculus**

by Roland Backhouse

2001**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.

Download or read it online for free here:

**Download link**

(0.5MB, PDF)

## Similar books

**An Introduction to the Theory of Computation**

by

**Eitan Gurari**-

**Computer Science Pr**

The book explores questions and terminologies concerning programs, computers, and computation. The exploration reduces to a study of mathematical theories, such as those of automata and formal languages, theories interesting in their own right.

(

**25380**views)

**Applicative Computing: Its quarks, atoms and molecules**

by

**V. E. Wolfengagen**-

**JurInfoR**

This work covers the advanced topics in main ideas of computing in general. Material is especially useful for the instructor, postgraduate and graduate students of IT-specialties and is suitable for the system of training of specialists.

(

**8100**views)

**Introduction to Computing: Explorations in Language, Logic, and Machines**

by

**David Evans**-

**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.

(

**10618**views)

**Models of Computation: Exploring the Power of Computing**

by

**John E. Savage**-

**Addison-Wesley**

The book re-examines computer science, giving priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint is motivated by more realistic computational models.

(

**5802**views)