**Computational Category Theory**

by D.E. Rydeheard, R.M. Burstall

2001**Number of pages**: 263

**Description**:

This book is an account of a project in which basic constructions of category theory are expressed as computer programs. The programs are written in a functional programming language, called ML, and have been executed on examples. The authors have used these programs to develop algorithms for the unification of terms and to implement a categorical semantics. In general, this book is a bridge-building exercise between category theory and computer programming. These efforts are a first attempt at connecting the abstract mathematics with concrete programs, whereas others have applied categorical ideas to the theory of computation.

Download or read it online for free here:

**Download link**

(0.9MB, PDF)

## Similar books

**Categories, Types, and Structures**

by

**Andrea Asperti, Giuseppe Longo**-

**MIT Press**

Here is an introduction to category theory for the working computer scientist. It is a self-contained introduction to general category theory and the mathematical structures that constitute the theoretical background.

(

**11091**views)

**Formal Syntax and Semantics of Programming Languages**

by

**Kenneth Slonneger, Barry L. Kurtz**-

**Addison Wesley Longman**

The book presents the typically difficult subject of formal methods in an informal, easy-to-follow manner. Readers with a basic grounding in discreet mathematics will be able to understand the practical applications of these difficult concepts.

(

**10081**views)

**Lecture Notes on Static Analysis**

by

**Michael I. Schwartzbach**-

**IT University of Copenhagen**

These notes present principles and applications of static analysis of programs. We cover type analysis, lattice theory, control flow graphs, dataflow analysis, fixed-point algorithms, narrowing and widening, control flow analysis, pointer analysis.

(

**2177**views)

**Implementing Functional Languages: a tutorial**

by

**Simon Peyton Jones, David Lester**-

**Prentice Hall**

This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. It is intended to be a source of practical material, to help make functional-language implementations come alive.

(

**7307**views)