A factorisation theorem in rewriting theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1290, Issue , 1997, Pages 49-68

  Melliès, Paul Andrè ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); FACTORIZATION; SEMANTICS;

LAMBDA CALCULUS; REWRITING SYSTEMS; REWRITING THEORY;

COMPUTATION THEORY;

EID: 84880228410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0026981     Document Type: Conference Paper

References (19)

1. J. Adamek, H. Herrlich, G. Strecker, "Abstract and Concrete Categories", Wiley Interscience in Pure and Applied Mathematics, 1990.
2. H. Barendregt, "The Lambda Calculus: Its Syntax and Semantics". North Holland, 1985.
3. G. Boudol, "Computational semantics of term rewriting systems". Algebraic methods in Semantics, Maurice Nivat and John C. Reynolds (eds), Cambridge University Press, 1985.
4. D. Clark and R. Kennaway, "Event structures and non-orthogonal term graph rewriting". To appear in MSGS, 1996.
5. D. Dikranjan and W. Tholen, "Categorical Structure of Closure Operators. With Applications to Topology, Algebra and Discrete Mathematics'', Kluwer Academic Publishers (Dordrecht, Boston, London), 1995.
6. P.J. Freyd, G.M. Kelly, "Categories of continuous functors, I". Journal of Pure and Applied Algebra 2, pp 169-191, 1972.
7. G. Gonthier, J-J. Lèvy, P-A. Melliès, "An abstract standardisation theorem". Seventh Annual IEEE Symposium on Logic In Computer Science, August 1992.
8. G. Huet, J-J. Lèvy, "CaE by Need Computations in Non-Ambiguous Linear Term Rewriting Systems". Rapport de recherche INRIA 359, 1979. Republished as "Computations in orthogonal rewriting systems, I and II", in Jean-Louis Lassez and Gordon Plotkin, editors, Computational logic, essays in honor of Alan Robinson, pages 395-443. MIT Press, Cambridge, Massachussets, 1991.
9. J. W. Klop, "Combinatory Reduction Systems". PhD thesis, Rijksuniversiteit Utrecht, Mathematics Centre Tract, volume 127, June 1980.
10. Y. Lafont, "A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)". Journal of Pure and Applied Algebra, 98, 1995.
11. Y. Lafont, Alain Proutè, "Church-Rosser property and homology of monoids". Mathematical Structures in Computer Science, 1, 297-326, 1991.
12. J-J. Lèvy, "Rèductions correctes et optimales dans le λcalcul". Thèse de Doctorat d'Etat, Universitè Paris 7, 1978.
13. S. Mac Lane, "Categories for the working mathematician", Springer Verlag, 1971.
14. P-A. Mellies, "Description abstraite des systemes de rèècriture", Thèse de l'Uni-versite Paris, 7, December 1996
15. P-A. Melliès, "Axiomatic Rewriting Theory I: An axiomatic standardisation theorem", in preparation
16. P-A. Melliès, "Axiomatic Rewriting Theory II: The lambda-sigma-calculus has the finite cone property", presented at the School on Rewriting and Type Theory, Glasgow, September 1996. Submitted to publication. Available by ftp at http://www.dcs.ed.ac.uk/home/paulm/.
17. P-A. Mellies, "Axiomatic Rewriting Theory IV: The fundamental theorem of rewriting theory", in preparation.
18. E. Stark, "Concurrent Transition Systems", Journal of Theoretical Computer Science, vol. 64, May 1989.
19. P. Taylor, "Practical Foundations", Cambridge Studies in Advanced Mathematics, 1997 (in preparation).