Category Theory and Computer Programming: Tutorial and Workshop, Guildford, U.K., September 16 - 20, 1985. Proceedings
David Pitt, Samson Abramsky, Axel Poigne, David Rydeheard
Springer, Nov 21, 1986 - Computers - 519 pages
15 pages matching Bool in this book
Results 1-3 of 15
What people are saying - Write a review
We haven't found any reviews in the usual places.
algebraic theories application arrows axioms behaviour Bool Burstall calculus cartesian closed categories category of sets category theory closure coequalizer colimits comma category components composition Computer Science concept condition construction control category coproduct corresponding deduction defined definition denotes diagram domain theory elements embedding equality equivalence example exists Extended ML finite limits formal formulas functor F Galois connection given Goguen homomorphism institution interpretation intuition isomorphism lattices left adjoint Lemma LNCS maps mathematical monad monoid morphism f natural transformation notation notion operations pairs partial functions partial morphisms partially ordered sets Petri nets Plotkin posets possible worlds power domains predicate transformers preserve programming language proof properties Proposition pullback recursive relation restriction right adjoint rules satisfy Scott semilattices sentences sequence signature morphism sort specification Springer Springer-Verlag stack Standard ML structure subset substitution synchronization Theorem topology topos trees type theory unique variables X-calculus