Category Theory and Computer Science: ProceedingsSpringer-Verlag, 1987 - Categories (Mathematics) |
Contents
G Rosolini | 1 |
Th Coquand Th Ehrhard | 40 |
S Kasangian A Labella A Pettorossi | 57 |
Copyright | |
12 other sections not shown
Other editions - View all
Common terms and phrases
2-category 2-cells 2TXC-hyperdoctrine 2TXC-theory a₁ abstract data types adjunction arrows automata axioms B₁ bisimulation cartesian closed category category theory circuit term cocomplete coequalizers colimits Computer Science congruence consider construction coproduct corresponding defined definition denoted diagram domain E-algebra effective topos elements epimorphism equational theory equivalence example exponential fact final algebra finite set forgetful functor formal function functor Galois connections given Goguen hierarchically consistent hyperdoctrine i-specification implementation induction initial algebra interpretation isomorphic language Lemma LNCS logic monoidal morphism natural numbers normal epimorphism notion o-sets operations pair parameterized partial maps polymorphic Proc processes programming Proof properties Proposition pullback pushout recursive reduction relation right adjoint satisfies Scott topology second order semantics signature sort SPEC Springer-Verlag structure subcategory subset subterm surjective symbols t₁ terminal object Theorem topology topos model type constructor typed lambda calculus Typemax unification algorithms variables