Computational Category Theory |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Introduction | 1 |
Functional Programming in ML | 9 |
Categories and Functors | 35 |
Copyright | |
9 other sections not shown
Common terms and phrases
abstract adjunctions applied binary coproducts blue pink bool calculate cartesian closed categories category of finite category theory Chapter cocomplete cocontinuous colimiting cocone comma category components composition consider datatype defined definition denned denote described diagram disjoint union dual duality edges elements encode example Exercise expressed finite colimits finite sets free algebras functional programming functor categories functor F G nodes(A Goguen initial object integers isomorphism labelled left adjoint let val limits and colimits logic maps mathematics monoid natural numbers natural transformations node(A nodes objects and arrows pair of arrows parallel pair polymorphism programming language proof pullback pushout recursive representation right adjoint semantics set of equations signature slice category sorts source and target structure subobject classifier substitution terminal object theorem tions topos toposes transitive closure truth-values types in ML unification algorithms unique arrow universal property values variables
Bibliographic information
| Title | Computational Category Theory Prentice-Hall International Series in Computer Science Prentice-Hall Series in Real Estate |
| Authors | D. David E. Rydeheard, Rod M. Burstall |
| Publisher | Prentice Hall, 1988 |
| Original from | the University of Michigan |
| Digitized | Nov 20, 2007 |
| ISBN | 0131627368, 9780131627369 |
| Length | 257 pages |
| Subjects | › Mathematics / Discrete Mathematics Mathematics / General Mathematics / Logic |
| Export Citation | BiBTeX EndNote RefMan |