An alternative formulation of operational conservativity with binding terms

Journal of Logic and Algebraic Programming

Volumn 55, Issue 1-2, 2003, Pages 1-19

  Middelburg, C A ^a,b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Operational conservative extension; Source dependency; Structural operational semantics; Transition system specification; Variable binding operator

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; COMPUTER SCIENCE;

TRANSITION SYSTEM SPECIFICATIONS (TSS);

SEMANTICS;

EID: 0037339234     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-8326(02)00039-5     Document Type: Article

References (19)

1. Groote J.F., Vaandrager F.W. Structured operational semantics and bisimulation as a congruence. Information and Computation. 100:1992;202-260.
2. Baeten J.C.M., Verhoef C. A congruence theorem for structured operational semantics with predicates. Best E. CONCUR'93, LNCS 715. 1993;477-492 Springer-Verlag.
3. Groote J.F. Transition system specifications with negative premises. Theoretical Computer Science. 118:1993;263-299.
4. Verhoef C. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing. 2:1995;274-302.
5. Bol R.N., Groote J.F. The meaning of negative premises in transition system specifications. Journal of the ACM. 43:1996;863-914.
6. Middelburg C.A. Variable binding operators in transition system specifications. Journal of Logic and Algebraic Programming. 47:2001;15-45.
7. Baeten J.C.M., Bergstra J.A. Real time process algebra. Formal Aspects of Computing. 3(2):1991;142-188.
8. Groote J.F., Ponse A. The syntax and semantics of. μ CRL Ponse A., Verhoef C., van Vlijmen S.F.M. Algebra of Communicating Processes 1994, Workshop in Computing Series. 1995;26-62 Springer-Verlag.
9. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice-Hall.
10. Milner R. Communication and Concurrency. 1989;Prentice-Hall.
11. Fokkink W.J., Verhoef C. A conservative look at operational semantics with variable binding. Information and Computation. 146:1998;24-54.
12. Sun Yong An algebraic generalization of Frege structures - binding algebras. Theoretical Computer Science. 211:1999;189-232.
13. Bernstein K.L. A congruence theorem for structured operational semantics of higher-order languages. LICS'98. 1998;153-164 IEEE Computer Science Press.
14. Bloom B. CHOCOLATE: calculi of higher order communication and lambda terms. Symposium on Principles of Programming Languages. 1994;339-347 ACM Press.
15. Glabbeek R.J. The meaning of negative premises in transition system specifications II. Meyer auf der Heide F., Monien B. Proceedings of 23rd ICALP, LNCS 1099. 1996;502-513 Springer-Verlag.
16. Fokkink W.J., Glabbeek R.J. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation. 126:1996;1-10.
17. Hennessy M., Milner R. Algebraic laws for non-determinism and concurrency. Journal of the ACM. 32:1985;137-161.
18. Baeten J.C.M., Middelburg C.A. Process algebra with timing: real time and discrete time. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;627-684 Elsevier.
19. Baeten J.C.M., Middelburg C.A. Process Algebra with Timing, EATCS Monographs Series. 2002;Springer-Verlag.