Logo

Computational Category Theory

Computational Category Theory
by


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.

Home page url

Download or read it online for free here:
Download link
(0.9MB, PDF)

Similar books

Book cover: A Practical Theory of ProgrammingA Practical Theory of Programming
by - Springer
Understanding programming languages requires knowledge of the underlying theoretical model. This book explores aspects of programming that are amenable to mathematical proof. It describes a simple and comprehensive theory.
(14502 views)
Book cover: Concrete Semantics: With Isabelle/HOLConcrete Semantics: With Isabelle/HOL
by - 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.
(6730 views)
Book cover: Proofs and TypesProofs and Types
by - 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.
(18166 views)
Book cover: Lecture Notes on Static AnalysisLecture Notes on Static Analysis
by - 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.
(7989 views)