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
![Book cover: Proofs and Types](images/3723.jpg)
by J. Girard, Y. Lafont, P. Taylor - Cambridge University Press
This little book comes from a short graduate course on typed lambda-calculus given at the Universite Paris. It is not intended to be encyclopedic and the selection of topics was really quite haphazard. Some very basic knowledge of logic is needed.
(18574 views)
![Book cover: Semantics: Advances in Theories and Mathematical Models](images/8893.jpg)
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.
(9892 views)
![Book cover: The Z Notation: A Reference Manual](images/5665.jpg)
by J. M. Spivey - Prentice Hall
The standard Z notation for specifying and designing software has evolved over the best part of a decade. This an informal but rigorous reference manual is written with the everyday needs of readers and writers of Z specifications in mind.
(12308 views)
![Book cover: Lecture Notes on Static Analysis](images/10562.jpg)
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.
(8342 views)