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

**Elements of Programming**

by

**Alexander Stepanov, Paul McJones**-

**Semigroup Press**

This book applies the deductive method to programming by affiliating programs with the abstract mathematical theories. Specification of these theories, algorithms and theorems and lemmas describing their properties are presented together.

(

**4664**views)

**Semantics: Advances in Theories and Mathematical Models**

by

**Muhammad Tanvir Afzal (ed.)**-

**InTech**

The book is a blend of a number of great ideas, theories, mathematical models, and practical systems in the domain of Semantics. Topics include: Background; Queries, Predicates, and Semantic Cache; Algorithms and Logic Programming; etc.

(

**8657**views)

**Reasoned Programming**

by

**Krysia Broda et al**-

**Prentice Hall Trade**

The text for advanced undergraduate/graduate students of computer science. It introduces functional, imperative and logic programming and explains how to do it correctly. Functional programming is presented as a programming language in its own right.

(

**12144**views)

**Lectures on the Curry-Howard Isomorphism**

by

**Morten Heine B. Sorensen, Pawel Urzyczyn**-

**Elsevier Science**

This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic.

(

**10610**views)