Boolean restriction categories and taut monads

Theoretical Computer Science

Volumn 360, Issue 1-3, 2006, Pages 77-95

  Manes, Ernie ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

Boolean categories; Dynamic logic; Monads in programming; Restriction categories

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORMAL LOGIC; SET THEORY;

DYNAMIC LOGIC; MONADS IN PROGRAMMING; RESTRICTION CATEGORIES;

BOOLEAN ALGEBRA;

EID: 33746607723     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.02.014     Document Type: Article

References (24)

1. Carboni A. Bicategories of partial maps. Cahiers Topologie Géom. Différentielle 28 (1987) 111-126
2. Cockett J.R.B., and Lack S. Restriction categories I: categories of partial maps. Theoret. Comput. Sci. 270 (2002) 223-259
3. Curien P.L., and Obtulowicz A. Partiality and cartesian categories. Inform. and Comput. 80 (1989) 50-95
4. Dijkstra E.W. A Discipline of Programming (1976), Prentice-Hall, Englewood Cliffs, NJ
5. DiPaola R.A., and Heller A. Dominical categories: recursion theory without elements. J. Symbolic Logic 52 (1987) 595-635
6. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.
7. Elgot C.C. Monadic computation and iterative algebraic theories. In: Rose H.E., and Shepherdson J.C. (Eds). Proc. Logic Colloq. '73 (1975), North-Holland, Amsterdam 175-230
8. Fischer M.J., and Ladner R.E. Propositional dynamic logic of regular programs. J. Comput. System Sci. 18 (1979) 286-294
9. Kleisli H. Every standard construction is induced by a pair of adjoint functors. Proc. Amer. Math. Soc. 16 (1965) 544-546
10. D. Kozen, A representation theorem for *-free PDL, Lecture Notes in Computer Science, Vol. 85, Springer, Berlin, 1980, pp. 351-362.
11. Lawson M.V. Inverse Semigroups, the Theory of Partial Symmetries (1998), World Scientific Publishing, Singapore
12. G. Longo, E. Moggi, Cartesian closed categories and partial morphisms for effective type structures, in: G. Kahn, D.B. McQueen, G. Plotkin (Eds.), Internat. Symp. Semantics of Data Types, Lecture Notes in Computer Science, Vol. 173, Springer, Berlin, 1984, pp. 235-255.
13. Manes E.G. Predicate Transformer Semantics (1992), Cambridge University Press, Cambridge
14. Manes E.G. Implementing collection classes with monads. Math. Structures Comput. Sci. 8 (1998) 231-276
15. E.G. Manes, Boolean monads for functional programming, in: N. Callaos, S. Long, M. Loutfi (Eds.), Proc. World Multiconference on Systemics, Cybernetics and Informatics ISAS/SCI 2001, Orlando, Florida, USA, XVII, 2001, pp. 189-193.
16. Manes E.G. Taut monads and T0 spaces. Theoret. Comput. Sci. 275 (2002) 79-109
17. Manes E.G. Monads of sets. In: Hazewinkel M. (Ed). Handbook of Algebra Vol. 3 (2003), Elsevier, Amsterdam 67-153
18. E.G. Manes, Guarded and banded semigroups, Semigroup Forum, to appear.
19. Moggi E. Partial morphisms in categories of effective objects. Inform. and Comput. 76 (1988) 250-277
20. Moggi E. Notions of computation and monads. Inform. and Comput. 93 (1991) 55-92
21. Mulry P.S. Monads and algebras in the semantics of partial data types. Theoret. Comput. Sci. 99 (1992) 141-155
22. V.R. Pratt, Semantical considerations on Floyd-Hoare Logic, in: Proc. 17th IEEE Symp. the Foundations of Computer Science, 1976, pp. 109-121.
23. Robinson E., and Rosolini G. Categories of partial maps. Inform. and Comput. 79 (1988) 95-130
24. Wadler P. Comprehending monads. Math. Structures Comput. Sci. 2 (1992) 461-493