GAP3 Program for Computing Left Kan Extensions

Bibliography

1
J. Adamek and J. Rosicky : Locally Presentable and Accessible Categories, (1994)

2
F. Baader and T. Nipkow : Term Rewriting and all That, C.U.P. (1998)

3
M. Barr and C. Wells : Toposes, Triples and Theories, Springer, Grundlehren der Mathematischen Wissenschaften Series no.278 (1985)

4
R. Book and F. Otto : String-Rewriting Systems, Springer-Verlag, New York (1993)

5
R. Brown and A. Razak-Salleh : Free crossed resolutions of groups and presentations of modules of identities among relations, LMS J. Comp. Math 2 p28-61 (1999)

6
B. Buchberger and F. Winkler : Gröbner Bases and Applications, ``33 Years of Gröbner Bases'' RISC-Linz 2-4 Feb 1998, Proc. London Math. Soc. vol.251 (1998).

7
C.M.Campbell and E.F.Robertson and N.Ruskuc and R.M.Thomas: Automatic semigroups, TCS (To appear)

8
S. Carmody and R. F. C. Walters : Computing Quotients of Actions on a Free Category, in A. Carboni, M. C. Pedicchio, G. Rosolini (eds), Category Theory, Proceedings of the Int. Conf. Como, Italy 22-28 July 1990, Springer-Verlag, (1991).

9
A. Chandler, A. Heyworth, L. Blair and D. Seward : Testing Petri nets for Mobile Robots using Gröbner Bases, Proc 21st Int. Conf. in Application and Theory of Petri nets, Software Engineering and Petri nets Workshop p21-34 (2000)

10
D. E. Cohen: String rewriting and homology of monoids, Math. Struct. in Comp. Science 7, (1997)

11
D. A. Cox, J. B. Little and D. O'Shea : Ideals, Varieties and Algorithms, Undergraduate Texts in Mathematics, Springer-Verlag (1992).

12
R. Cremanns and F. Otto : For groups the property of having finite derivation type is equivalent to the homological finiteness condition 4#4, J. Symbolic Computation, 22 p155-177, (1996)

13
E. J. Dubuc : Kan Extensions in Enriched Category Theory Springer Lecture Notes in Mathematics, vol.245 (1970)

14
D.B.A. Epstein with J.W.Cannon et al : Word processing in groups, Jones and Bartlett, Boston (1992)

15
M. Fleming, R. Gunther and R. Rosebrugh : User Guide for the Categories Database and Manual, anonymous ftp://sun1.mta.ca/pub/papers/rosebrugh/catdsalg.dvi,tex and /catuser.dvi,tex (1996)

16
THE  GAP GROUP, `GAP - Groups, Algorithms, and Programming, Version 4', Aachen, St Andrews, (1998)

17
N. Ghani and C. Lüth : Monads and Modular Rewriting, Proceedings of CTCS'97 (1997)

18
N. Ghani and C. Lüth : An Introduction to Categorical Rewriting, Univ. of Leicester Tech. Rep. (2000)

19
J. Goguen and T. Winkler : Introducing obj3, Technical Report SRI-CSL-88-8, SRI (1993)

20
A. Heyworth: Applications of Rewriting Systems and Gröbner Bases to Computing Kan Extensions and Identities Among Relations, PhD thesis, Bangor, (1998)

21
A. Heyworth and C. D. Wensley : Logged Rewriting with Applications to Identities Among Relations, UWB Math Preprint 99.07, (1999)

22
A. Heyworth and J. Snellman : Gröbner Basis Theory for Modules, (in prep.)

23
A. Heyworth and M. Johnson : Logged Rewriting and Finite Derivation Type for Monoids, (in prep.)

24
D. F. Holt : Knuth-Bendix in Monoids, and Automatic Groups, Univ. of Warwick (1996).

25
D. F. Holt and S. Rees: A graphics system for displaying finite quotients of finitely presented groups, Proc. DIMACS Workshop on Groups and Computation, AMS-ACM (1991)

26
C. B. Jay : Modelling Reduction in Confluent Categories Applications of Categories in Computer Science p143-62 C.U.P. (1992)

27
S. Peyton Jones : The Implementation of Functional Programming Languages, Prentice Hall (1986)

28
D. M. Kan: Adjoint Functors, Trans. Am. Math. Soc. 87 p294-329 (1958)

29
G. M. Kelly : Basic Concepts of Enriched Category Theory, London Math Soc. C.U.P. no.64 (1982)

30
B. Keller : The Opal System Virginia Polytechnic Institute and State University, (2000)

31
J. W. Klop, A. Middeldorp, Y. Toyama and R. de Vrijer : A Simplified Proof of Toyama's Theorem, Information Processing Letters 49 p101-9 (1992)

32
F. W. Lawvere : Functorial Semantics of Algebraic Theories, Proc. Nat. Acad. of Sci. 50 p869-72 (1963)

33
F. E. J. Linton : Some Aspects of Equational Categories, Proc. of Conference on Categorical Algebra p84-94 Springer-Verlag (1965)

34
S. A. Linton : On Vector Enumeration, Linear Algebra and its Applications 192 p235-48 (1993)

35
C. Lüth : Compositional Categorical Term Rewriting in Structured Algebraic Specifications, PhD Thesis, University of Edinburgh, Department of Computer Science (1997)

36
S. MacLane : Categories for the Working Mathematician, Springer-Verlag, (1971)

37
K. Madlener and B. Reinert : String rewriting and Gröbner bases - a general approach to monoid and group rings, Proc. Workshop on Symbolic Rewriting Techniques, (Birkhäuser, p127-180), (1998)

38
T.Murata : Petri nets: Properties, Analysis and Applications, Proceedings of the IEEE, vol.77 no.4 (1989)

39
B. Reinert and D. Zecker: MRC: a system for computing Gröbner bases in monoid and group rings, 6th Rhine workshop on Computer Algebra, Sankt Augustin, (1998)

40
D. E. Rydeheard and J. G. Stell : Foundations of Equational Deduction - A Categorical Treatment of Equational Proofs and Unification Algorithms, Proc. CTCS'87 LNCS 283 114-139 Springer (1987)

41
R. A. G. Seely : Modelling Computations: A 2-categorical Framework, Symposium on Logic in Computer Science p65-71 IEEE Computer Society Press (1987)

42
C. C. Sims : Computation with Finitely Presented Groups, Cambridge University Press (1994).

43
C. C. Squier : A finiteness condition for rewriting systems, revision by F. Otto and Y. Kobayashi, Theoretical Computer Science 131, p271-294, (1994)

44
Y. Toyama : On the Church-Rosser Property for the Direct Sum of Term rewriting Systems, Journal of the ACM 34 128-43 (1987)


Details of the prototype of Kan.

A more detailed description of the project.

Back to Anne's home page.


[University Home][MCS Home][University Index A-Z][University Search][University Help]

Author: Anne Heyworth
Last updated: 11th May 2001
MCS Web Maintainer
Any opinions expressed on this page are those of the author.
© University of Leicester.