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

**Programming Languages: Application and Interpretation**

by

**Shriram Krishnamurthi**-

**Lulu.com**

The textbook for a programming languages course, taken primarily by advanced undergraduate and beginning graduate students. This book assumes that students have modest mathematical maturity, and are familiar with the existence of the Halting Problem.

(

**11328**views)

**Compositional Semantics**

by

**Gary Hardegree**-

**UMass Amherst**

Contents: Basic Categorial Syntax; Shortcomings of Standard Categorial Syntax; Expanded Categorial Syntax; Examples of Expanded Categorial Syntax; Categorial Logic; Basic Categorial Semantics; Lambda-Abstraction; Expanded Categorial Semantics; etc.

(

**13893**views)

**Understanding Programming Languages**

by

**Monti Ben-Ari**-

**John Wiley & Sons**

The book explains what alternatives are available to the language designer, how language constructs should be used for safety and readability, how language constructs are implemented, the role of language in expressing and enforcing abstractions.

(

**15183**views)

**The Theory of Languages and Computation**

by

**Jean Gallier, Andrew Hicks**-

**University of Pennsylvania**

From the table of contents: Automata; Formal Languages (A Grammar for Parsing English, Context-Free Grammars, Derivations and Context-Free Languages, Normal Forms for Context-Free Grammars, Chomsky Normal Form, ...); Computability; Current Topics.

(

**7221**views)