Functorial semantics of rewrite theories

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

Volumn 3393 LNCS, Issue , 2005, Pages 220-235

  Meseguer, José ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ENGINEERING; DATA STRUCTURES; PARAMETERIZATION; SYSTEMS ENGINEERING;

CONCURRENCY MODELS; FUNCTORIAL SEMANTICS; REWRITE THEORIES; THEORY MORPHISMS;

SEMANTICS;

EID: 36849010650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-31847-7_13     Document Type: Article

References (34)

1. M. Barr and C. Wells. Topases, Triples and Theories. Springer-Verlag, 1985.
2. J. Bénabou. Structures algébriques dans les catégories. Cahiers de Topologie et Géometrie Différentielle, 10:1-126, 1968.
3. R. Bruni. Tile Logic for Synchronized Rewriting of Concurrent Systems. PhD thesis, Dipartimento di Informatica, Universita di Pisa, 1999. Technical Report TD-1/99. http://www.di.unipi.it/phd/tesi/tesi_1999/TD-1-99.ps. gz.
4. R. Bruni and J. Meseguer. Generalized rewrite theories. In J. Baeten, J. Lenstra, J. Parrow, and G. Woeginger, editors, Proceedings of ICALP 2003, 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Springer LNCS, pages 252-266, 2003.
5. R. Bruni, J. Meseguer, and U. Montanari. Symmetric monoidal and cartesian double categories as a semantic framework for tile logic. Mathematical Structures in Computer Science, 12:53-90, 2002.
6. R. Burstall and J. Goguen. Putting theories together to make specifications. In R. Reddy, editor, Proceedings, Fifth International Joint Conference on Artificial Intelligence, pages 1045-1058. Department of Computer Science, Carnegie-Mellon University, 1977.
7. M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187-243, 2002.
8. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. Maude 2.0 Manual. June 2003, http://maude.cs.uiuc. edu.
9. A. Corradini, F. Gadducci, and U. Montanari. Relating two categorical models of term rewriting. In J. Hsiang, editor, Proc. Rewriting Techniques and Applications, Kaiserslautern, pages 225-240, 1995.
10. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 243-320. North-Holland, 1990.
11. F. Duran and J. Meseguer. On parameterized theories and views in Full Maude 2.0. In K. Futatsugi, editor, Proc. 3rd. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2000.
12. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specifications 1, Equations and Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.
13. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specifications 2, Module Specifications and Constraints, volume 21 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1990.
14. S. Eilenberg and J. C. Moore. Adjoint functors and triples. Illinois J. Math., 9:381-398, 1965.
15. P. Gabriel and F. Ulmer. Lokal präsentierbare Kategorien. Springer Lecture Notes in Mathematics No. 221, 1971.
16. F. Gadducci. On the Algebraic Approach to Concurrent Term Rewriting. PhD thesis, Dipartimento di Informatica, Universita di Pisa, Mar. 1996. Technical Report TD-2/96.
17. F. Gadducci and U. Montanari. The tile model. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. The MIT Press, 2000. http://www.di.unipi.it/~ugo/festschrift. ps.
18. G. Kelly. Basic Concepts of Enriched Category Theory. Cambridge Univ. Press, 1982.
19. G. Kelly. Structures defined by finite limits in the enriched context, I. Cahiers de Topologie et Géometrie Différentielle, 23:3-42, 1982.
20. G. Kelly and R. Street. Review of the elements of 2-categories. In G. Kelly, editor, Category Seminar, Sydney 1972/73, pages 75-103. Springer Lecture Notes in Mathematics No. 420, 1974.
21. F. W. Lawvere. Functorial semantics of algebraic theories. Proceedings, National Academy of Sciences, 50:869-873, 1963. Summary of Ph.D. Thesis, Columbia University.
22. S. MacLane. Categories for the Working Mathematician. Springer-Verlag, 1971.
23. N. Martí-Oliet, J. Meseguer, and M. Palomino. Theoroidal maps as algebraic simulations. To appear in Proc. WADT'04, Springer LNCS, 2004.
24. J. Meseguer. Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory, February 1990. Revised June 1990.
25. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
26. J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, Proc. WADT'97, pages 18-61. Springer LNCS 1376, 1998.
27. J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105-155, 1990.
28. J. Meseguer and U. Montanari. Mapping tile logic into rewriting logic. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT'97, Tarquinia, Italy, June 3-7, 1997, Selected Papers, volume 1376 of Lecture Notes in Computer Science, pages 62-91. Springer-Verlag, 1998.
29. J. Meseguer, M. Palomino, and N. Martí-Oliet. Equational abstractions, in Proc. CADE-19, Springer LNCS, Vol. 2741, 2-16, 2003.
30. H. Miyoshi. Modelling conditional rewriting logic in structured categories. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier, 1996.
31. A. Pitts. An elementary calculus of approximations. Unpublished manuscript, University of Sussex, December 1987.
32. D. Rydeheard and J. Stell. Foundations of equational deduction: A categorical treatment of equational proofe and unification algorithms. In Proceedings of the Summer Conference on Category Theory and Computer Science, Edinburgh, Sept. 1987, pages 114-139. Springer LNCS 283, 1987.
33. J. Stell. Modelling term rewriting systems by sesqui-categories. Technical Report TR94-02, Keele University, 1994. Also in shorter form in Proc. C.A.E.N., 1994, pp. 121-127.
34. R. Street. Limits indexed by category-valued 2-functors. J. Pure Appl. Algebra, 8:149-181, 1976.