Variable binding operators in transition system specifications

Journal of Logic and Algebraic Programming

Volumn 47, Issue 1, 2001, Pages 15-45

  Middelburg, C A ^a,b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Binding algebras; Binding terms; Bisimulation; Congruence; Many sortedness; Panth format; Partial stable models; Structural operational semantics; Transition system specifications; Variable binding operators

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION;

STRUCTURAL OPERATIONAL SEMANTICS (SOS); VARIABLE BINDING OPERATORS;

MATHEMATICAL OPERATORS;

EID: 0034825019     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-8326(00)00003-5     Document Type: Article

References (38)

1. L. Aceto, W.J. Fokkink, C. Verhoef, Structural operational semantics, in: J.A. Bergstra, A. Ponse, S.A. Smolka (Eds.), Handbook of Process Algebra, Elsevier, Amsterdam, 2001.
2. P. Aczel, Frege structures and the notions of proposition, truth and set, in: J. Barwise, H.J. Keisler, K. Kunen (Eds.), The Kleene Symposium, North-Holland, Amsterdam, 1980, pp. 31-59.
3. K.R. Apt, R.N. Bol, Logic programming and negation: a survey, J. Logic Programming 19-20 (1994) 9-71.
4. J.C.M. Baeten, J.A. Bergstra, Real time process algebra, Formal Aspects Comput 3 (2) (1991) 142-188.
5. J.C.M. Baeten, C.A. Middelburg, Process algebra with timing: real time and discrete time, in: J.A. Bergstra, A. Ponse, S.A. Smolka (Eds.), Handbook of Process Algebra, Elsevier, Amsterdam, 2001.
6. J.C.M. Baeten, C. Verhoef, A congruence theorem for structured operational semantics with predicates, in: E. Best (Ed.), CONCUR'93, Lecture Notes in Computer Science, vol. 715, Springer, Berlin, 1993, pp. 477-492.
7. K.L. Bernstein, A congruence theorem for structured operational semantics of higher-order languages, in: LICS '98, IEEE Computer Science Press, Silver Spring, MD, 1998, pp. 153-164.
8. B. Bloom, CHOCOLATE: Calculi of higher order communication and lambda terms, in: Symposium on Principles of Programming Languages, ACM Press, New York, 1994, pp. 339-347.
9. B. Bloom, S. Istrail, A.R. Meyer, Bisimulation can't be traced, J. ACM 42 (1995) 232-268.
10. R.N. Bol, J.F. Groote, The meaning of negative premises in transition system specifications, J. ACM 43 (1996) 863-914.
11. L. Chen, An interleaving model for real-time systems, in: A. Nerode, M. Taitslin (Eds.), Symposium on Logical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 620, Springer, Berlin, 1992, pp. 81-92.
12. P.R. D'Argenio, C. Verhoef, A conservative extension theorem in process algebras with inequalities, Theoret. Comput. Sci. 177 (1997) 351-380.
13. M.H. van Emden, R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23 (1976) 733-742.
14. M.P. Fiore, G.D. Plotkin, D. Turi, Abstract syntax and variable binding, in: LICS '99, IEEE Computer Science Press, Silver Spring, MD, 1999, pp. 199-203.
15. M. Fitting, A Kripke-Kleene semantics for general logic programs, J. Logic Programming 2 (1985) 295-312.
16. W.J. Fokkink, R.J. van Glabbeek, Ntyft/ntyxt rules reduce to ntree rules, Informat. Comput. 126 (1996) 1-10.
17. W.J. Fokkink, C. Verhoef, A conservative look at operational semantics with variable binding, Informat. Comput. 146 (1998) 24-54.
18. V.C. Galpin, Comparison of process algebra equivalences using formats, in: J. Wiedermann, P. van Emde Boas, M. Nielsen (Eds.), Proceedings 26th ICALP, Lecture Notes in Computer Science, vol. 1644, Springer, Berlin, 1999, pp. 341-350.
19. A. van Gelder, K. Ross, J. Schlipf, The well-founded semantics for general logic programs, J. ACM 38 (1991) 620-650.
20. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: R.A. Kowalski, K.A. Bowen (Eds.), Fifth International Conference and Symposium on Logic Programming, ALP, MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
21. R.J. van Glabbeek, The meaning of negative premises in transition system specifications II, in: F. Meyer auf der Heide, B. Monien (Eds.), Proceedings 23th ICALP, Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, 1996, pp. 502-513.
22. J.F. Groote, Transition system specifications with negative premises, Theoret. Comput. Sci. 118 (1993) 263-299.
23. J.F. Groote, A. Ponse, The syntax and semantics of μCRL, in: A. Ponse, C. Verhoef, S.F.M. van Vlijmen (Eds.), Algebra of Communicating Processes 1994, Workshop in Computing Series, Springer, Berlin, 1995, pp. 26-62.
24. J.F. Groote, F.W. Vaandrager, Structured operational semantics and bisimulation as a congruence, Informat. Comput. 100 (1992) 202-260.
25. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, 1985.
26. D.J. Howe, Proving congruence of bisimulation in functional programming languages, Informat. Comput. 124 (1996) 103-112.
27. J.W. Klop, V. van Oostrom, F. van Raamsdonk, Combinatory reduction systems: introduction and survey, Theoret. Comput. Sci. 121 (1993) 279-308.
28. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, 1989.
29. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes: Part I and II, Informat. Comput. 100 (1992) 1-77.
30. X. Nicollin, J. Sifakis, The algebra of timed processes ATP: theory and application, Informat. Comput. 114 (1994) 131-178.
31. D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proceedings 5th GI Conference, Lecture Notes in Computer Science, vol. 104, Springer, Berlin, 1981, pp. 167-183.
32. T.C. Przymusinski, The well-founded semantics coincides with the three-valued stable semantics, Fundamenta Informaticae 13 (1990) 445-463.
33. D. Sands, From SOS rules to proof principles: an operational metatheory for functional languages, in: Symposium on Principles of Programming Languages, ACM Press, New York, 1997, pp. 428-441.
34. D. Sangiorgi, A theory of bisimulation for the π-calculus, Acta Informatica 33 (1996) 69-97.
35. R. de Simone, Higher-level synchronising devices in MEIJE-SCCS, Theoret. Comput. Sci. 37 (1985) 245-267.
36. SunYong, An algebraic generalization of Frege structures - binding algebras, Theoret. Comput. Sci. 211 (1999) 189-232.
37. B. Thomsen, A theory of higher order communicating systems, Informat. Comput. 116 (1995) 38-57.
38. C. Verhoef, A congruence theorem for structured operational semantics with predicates and negative premises, Nordic J. Comput. 2 (1995) 274-302.