Computing left Kan extensions

Journal of Symbolic Computation

Volumn 35, Issue 2, 2003, Pages 107-126

  Bush, M R ^a   Leeming, M ^a   Walters, R F C ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037331356     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(02)00102-5     Document Type: Review

References (8)

1. Carmody, S., Walters, R.F.C., 1991. Computing quotients of actions on a free category. In: Carboni, A., Pedicchio, M.C., Rosolini, G. (Eds.), Category Theory, Proceedings of the International Conference Held in Como, Italy, 22-28 July 1990. Springer.
2. Chandy, K., Misra, J., 1988. Parallel Program Design. Addison-Wesley, Reading, MA.
3. Coxeter, H.S.M., Moser, W.O.J., 1957. Generators and Relations for Discrete Groups. Springer.
4. Leech, J., 1963. Coset enumeration in digital computers. Proc. Camb. Phil. Soc. 59, 257-267.
5. Leeming, M., Walters, R.F.C., 1995. Computing left Kan extensions using the Todd-Coxeter procedure. In: van der Poorten, Bosma (Eds.), Computational Algebra and Number Theory. Kluwer, pp. 53-73.
6. Sims, C., 1994. Computing with Finitely Presented Groups. Cambridge University Press, Cambridge.
7. Todd, J., Coxeter, H.S.M., 1936. A practical method for enumerating cosets of a finite abstract group. Proc. Edinburgh Math. Soc. (2nd series) 5, 26-34.
8. Walters, R.F.C., 1991. Categories and Computer Science, Cambridge Computer Science Texts, vol. 28, Carslaw Publications, Cambridge University Press, 1992.