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

**Concrete Semantics: With Isabelle/HOL**

by

**Tobias Nipkow, Gerwin Klein**-

**Springer**

The book teaches the reader the art of precise logical reasoning and the practical use of a proof assistant as a tool for formal proofs about computer science artefacts. All the mathematics is formalised in Isabelle and much of it is executable.

(

**6059**views)

**Semantics With Applications: A Formal Introduction**

by

**Hanne Riis Nielson, Flemming Nielson**-

**John Wiley & Sons**

The book covers the foundations of structural operational semantics and natural semantics. It shows how to describe the semantics of declarative as well as imperative language constructs and will also touch upon non-sequential constructs.

(

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

(

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

(

**12739**views)