Axiomatic rewriting theory I: A diagrammatic standardization theorem

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

Volumn 3838 LNCS, Issue , 2005, Pages 554-638

  Melliès, Paul André ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); NUMERICAL METHODS; PETRI NETS; PROBLEM SOLVING; THEOREM PROVING;

AXIOMATIC REWRITING THEORY; DIMENSIONAL TRANSITION GRAPHS; STANDARDIZATION THEOREM; TRANSITION SYSTEMS;

AUTOMATA THEORY;

EID: 37149039226     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11601548_23     Document Type: Article

References (41)

1. M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy. Explicit substitutions. Proceedings of Principle Of Programming Languages, 1990.
2. F. Baader, T. Nipkow. Term rewriting and all that. Cambridge University Press, 1998.
3. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, 1985.
4. M. A. Bednarczyck, Categories of asynchronous systems. PhD thesis, University of Sussex, 1988.
5. G. Berry. Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d'Etat, Université Paris VII, 1979.
6. G. Boudol. Computational semantics of term rewriting systems. Algebraic methods in Semantics, Maurice Nivat and John C. Reynolds (eds). Cambridge University Press, 1985.
7. A. Church, J.B. Rosser. Some properties of conversion. Trans. Amer. Math. Soc. 39, pp. 472-482, 1936.
8. D. Clark, R. Kennaway. Event structures and non-orthogonal term graph rewriting. Mathematical Structure in Computer Science, vol. 6, pp. 545-578, 1996.
9. P.-L. Curien, T. Hardin, A. Ríos. Strong normalization of substitutions. Lecture Notes in Computer Science, 629:209-217, 1992.
10. H.-B. Curry, R. Feys. Combinatory Logic. North Holland Volume 1, 1958.
11. N. Dershowitz, J.-P. Jouannaud. Rewrite systems. Chap. 6 of Handbook of Theoretical Computer Science B: Formal Methods and Semantics, J. van Leeuwen, ed., North-Holland, Amsterdam (1990) 243-320
12. M. Felleisen, R. Hieb. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 1992.
13. G. Gonthier, J.-J. Lévy, P.-A. Melliès. An abstract standardization theorem. Proceedings of the 7th Annual IEEE Symposium on Logic In Computer Science, Santa Cruz, 1992.
14. T. Hardin. Confluence Results for the Pure Strong Categorical Combinatory Logic. λ-calculi as subsystems of CCL. Journal of Theoretical Computer Science, 1989.
15. T. Hardin, L. Maranget, B. Pagano. Functional Back-Ends within the LambdaSigma Calculus. Proc. of the 1996 International Conference on Functional Programming, 1996.
16. B. P. Hilken. Towards a proof theory of rewriting: the simply typed 2A-calculus. Theoretical Computer Science 170, pages 407-444, 1996.
17. G. Huet. Confluent Reductions : Abstract Properties and Applications to Term Rewriting Systems. Journal of the Association for Computing Machinery vol. 27, No 4 (1980), 797-821.
18. G. Huet, J.-J. Lévy. Call by Need Computations in Non-Ambiguous Linear Term Rewriting Systems. Rapport de recherche INRIA 359, 1979.
19. Reprinted as: Computations in orthogonal rewriting systems. In J.-L. Lassez and G. D. Plotkin, editors, Computational Logic; Essays in Honor of Alan Robinson, pages 394-443. MIT Press, 1991.
20. J.-P. Jouannaud. Rewrite proofs and computations. In Proof and Computation. Helmut Schwichtenberg, ed. NATO series F: Computer and Systems Sciences, vol. 139, pp. 173-218, Springer Verlag, 1995.
21. J.W. Klop. Combinatory Reduction Systems. Thèse de l'Université d'Utrecht, Pays-Bas (1980).
22. J.W. Klop. Term Rewriting Systems. Handbook of Logic in Computer Science, Volume 2, in S. Abramsky, Dov M. Gabbay, T.S.E. Maibaum, editors, Oxford Science Publications, 1992.
23. J.W. Klop, V. van Oostrom, R. de Vrijer. Orthogonality. Chapter 4 in the book Term Rewriting System, edited by TeReSe, Cambridge Tracts in Theoretical Computer Science, Volume 55, Cambridge University Press, 2003.
24. T. Leinster. Higher Operads, Higher Categories. London Mathematical Society Lecture Note Series 298, Cambridge University Press, 2003.
25. J.-J. Lévy. Réductions correctes et optimales dans le λ-calcul. Thèse de Doctorat d'Etat, Université Paris VII, 1978.
26. S. Mac Lane. "Categories for the working mathematician", Second Edition, Graduate Texts in Mathematics 5, Springer-Verlag, 1998.
27. P.-A. Melliès. Typed Lambda-Calculi with Explicit Substitutions may not terminate. Proceedings of TLCA'95. Lecture Notes in Computer Science 902, Springer, 1995.
28. P.-A. Melliès. Description abstraite des Systèmes de Réécriture. Thèse de Doctorat, Université Paris VII, 1996.
29. P.-A. Melliès. Axiomatic Rewriting Theory II: The lambda-sigma-calculus enjoys finite normalisation cones. Journal of Logic and Computation, special issue devoted to the School on Rewriting and Type Theory, 2000.
30. P.-A. Melliès. Axiomatic Rewriting Theory III: A factorisation theorem in Rewriting Theory. Proceedings of the 7th Conference on Category Theory and Computer Science, Santa Margherita Ligure. Lecture Notes in Computer Science 1290, pp. 49-68, 1997.
31. P.-A. Melliès. Axiomatic Rewriting Theory IV: A stability theorem in Rewriting Theory. Proceedings of the 14th Annual Symposium on Logic in Computer Science, Indianapolis, 1998.
32. P.-A. Melliès. Axiomatic Rewriting Theory VI: Residual Theory Revisited. Proceedings of Conference on Rewriting Techniques and Applications, LNCS 2378, Springer Verlag, Kobenhavn, 2002.
33. M. H. A. Newman. On theories with a combinatorial definition of "equivalence". Annals of Mathematics, 43, Number 2, pages 223-243, 1942.
34. M. Nielsen, G. Winskel. Models for concurrency. In Handbook of Logic in Computer Science, Abramsky, Gabbay, Maibaum editors, Oxford Science, 1995.
35. V. van Oostrom. Confluence for abstract and higher-order rewriting. PhD Thesis, Vrije Universiteit, 1994.
36. V. van Oostrom, R. de Vrijer. Equivalence of reductions. Chapter 8 in the book Term Rewriting System, edited by TeReSe, Cambridge Tracts in Theoretical Computer Science, Volume 55, Cambridge University Press, 2003.
37. F. van Raamsdonk. Confluence and normalization for higher-order rewriting, PhD Thesis, Vrije Universiteit, Amsterdam, 1996.
38. P. Panangaden, V. Shanbhogue, E. W. Stark. Stability and sequentiality in data flow networks. Proceedings of ICALP'90, Lecture Notes in Computer Science 443, Springer, 1990.
39. G. Plotkin. Call-by-name, call-by-value, and the λ-calculus. Theoretical Computer Science 1, 1975.
40. M. W. Shields. Concurrent machines. Computer Journal, 28:449-465, 1985.
41. H. Zantema. Termination of term rewriting by interpretation. Lecture Notes in Computer Science 656, Springer Verlag, 1993.