Operational semantics of rewriting with priorities

Theoretical Computer Science

Volumn 200, Issue 1-2, 1998, Pages 289-312

  Van De Pol, Jaco ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Negative premises; Rule priorities; Structural operational semantics; Term rewriting systems; Transition system specification

Indexed keywords

EID: 0008487698     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00283-1     Document Type: Article

References (7)

1. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, W.P. Weijland, Term-rewriting systems with rule priorities, Theoret. Comput. Sci. 67 (2-3) (1989) 283-302.
2. R. Bol, J.F. Groote, The meaning of negative premises in transition system specifications, J. ACM 43 (5) (1996) 863-914.
3. W.J. Fokkink, C. Verhoef, A conservative look at term deduction systems with variable binding, Logic Group Preprint Series 140, Utrecht University, 1995.
4. J.R. Kennaway, The specificity rule for lazy pattern-matching in ambiguous term rewrite systems, in: Proc. 3rd European Symp. on Programming, Lecture Notes in Computer Science, vol. 432, Springer, Berlin, 1990, pp. 256-270.
5. A. Laville, Comparison of priority rules in pattern matching and term rewriting, J. Symbol. Comput. 11 (1991) 321-347.
6. C.K. Mohan, Priority rewriting: semantics, confluence, and conditionals, in: N. Dershowitz (Ed.), Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications, Chapel Hill, NC, April 1989. Lecture Notes in Computer Science, vol. 355, Springer, Berlin, 1989, pp. 278-291.
7. R.J. van Glabbeek, The meaning of negative premises in transition system specifications II (extended abstract), in: F. Meyer auf der Heide, B. Monien (Eds.), Automata, Languages and Programming, 23rd ICALP, Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, 1996, pp. 502-513. (Full version appeared as technical note STAN-CS-TN-95-16).