A modular rewriting semantics for CML

Journal of Universal Computer Science

Volumn 10, Issue 7, 2004, Pages 789-807

  Chalub, Fabricio ^a   Braga, Christiano ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Concurrent ML; Modularity; Rewriting logic; Semantics of programming languages

Indexed keywords

EID: 23844485521     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (27)

1. P. Bertelsen, L. Birkedal, M. Elsman, N. Hallenberg, T. H. Olesen, N. Rothwell, P. Sestoft, M. Tofte, and D. N. Turner. ML Kit. http://www.itu.dk/ research/mlkit/.
2. P. Borovanský, C. Kirchner, H. Kirchner, and P.-E. Moreau. Elan from a rewriting logic point of view. Theoretical Computer Science, 285:155-185, 2002.
3. C. Braga. Rewriting Logic as a Semantic Framework for Modular Structural Operational Semantics. PhD thesis, Pontifícia Universidade Católica, do Rio de Janeiro, September 2001. http://www.ic.uff.br/ ~cbraga.
4. C. Braga and J. Meseguer. Modular rewriting semantics in practice. In N. Martí-Oliet, editor, Proceedings of 5th International Workshop on Rewriting Logic and its Applications, WRLA 2004, Electronic Notes in Theoretical Computer Science. Elsevier, 2004. To appear.
5. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. The maude 2.0 system. In R. Nieuwenhuis, editor, Rewriting Techniques and Applications (RTA 2003), number 2706 in Lecture Notes in Computer Science, pages 76-87. Springer-Verlag, June 2003.
6. S. Eker, J. Meseguer, and A. Sridharanarayanan. The Maude LTL model checker. In F. Gadducci and U. Montanari, editors, Fourth Workshop on Rewriting Logic and its Applications, WRLA '02, volume 71 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002.
7. A. Farzan, F. Chen, J. Meseguer, and G. Roşu. Formal analysis of Java programs in JavaFAN. In CAV'04, Proc. 16th Intl. Conf. on Computer Aided Verification. Boston, USA, Lecture Notes in Computer Science. Springer, 2004. To appear.
8. K. Futatsugi and R. Diaconescu. Cafeobj report. World Scientific, AMAST Series, 1998.
9. J. A. Goguen and G. Malcolm. Algebraic Semantics of Imperative Programs. MIT Press, Cambridge, MA, USA, 1996.
10. G. Kahn. Natural semantics. Report 601, Inria, Institut national de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquencourt B.P.105 78153 Le Chesnay Cedex Fance, February 1987.
11. B. Laboratories, P. University, Y. University, and A. Research. Standard ML of New Jersey, http://www.smlnj.org/.
12. N. Martí-Oliet and J. Meseguer. Handbook of Philosophical Logic, volume 61, chapter Rewriting Logic as a Logical and Semantic Framework. Kluwer Academic Publishers, second edition, 2001. http://maude.cs.uiuc.edu/papers.
13. D. Matthews. Poly/ML. http://www.polyml.org/.
14. J. Meseguer. Conditional rewriting as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, April 1992.
15. J. Meseguer. Software specification and verification in rewriting logic. In Models, Algebras and Logic of Engineering Software, NATO Advanced Study Institute, July 30 - August 11, 2002, pages 133-193. IOS Press, 2003.
16. J. Meseguer and C. Braga. Modular rewriting semantics of programming languages. In AMAST'04, Proc. 10th Intl. Conf. on Algebraic Methodology and Software Technology, Sterling, UK, Lecture Notes in Computer Science. Springer, 2004. To appear.
17. J. Meseguer, M. Palomino, and N. Martí-Oliet. Equational abstractions. In F. Baader, editor, Automated Deduction - CADE-19. 19th International Conference on Automated Deduction, Miami Beach, FL, USA, July 28 - August 2, 2008, Proceedings, volume 2741 of Lecture Notes in Computer Science, pages 2-16. Springer-Verlag, 2003.
18. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The definition of Standard ML (Revised). MIT Press, 1997.
19. P. D. Mosses. Fundamental concepts and formal semantics of programming languages - an introductory course. Lecture notes, University of Aarthus, Denmark, 2002. http://wiki.daimi.au.dk/dSprogSem-01/dSprogSem-01.wiki.
20. P. D. Mosses. Definitive semantics. Lecture notes, Warsaw University, 2003. http://www.mimuw.edu.pl/~mosses/DS-03.
21. P. D. Mosses. Modular structural operational semantics. Journal of Logic and Algebraic Programming, 60-61:195-228, 2004. To appear.
22. U. of Cambridge Computer Laboratory. HOL, automated proof system for higher order logic, http://hol.sourceforge.net/.
23. L. Paulson and T. Nipkow. Isabelle, a generic theorem proving environment. http://www.cl.cam.ac.uk/Research/HVG/Isabelle/.
24. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN - 19, Computer Science Department, Aarhus University, 1981.
25. J. Reppy. Higher-Order Concurrency. PhD thesis, Cornell University, June 1992. Technical Report TR 92-1285.
26. P. Sestoft. Moscow ML. http://www.itu.dk/research/mlkit/.
27. J. A. Verdejo. Maude como um marco semântico ejecutable. PhD thesis, Universidad Complutense Madrid, 2003.