Variable binding operators in transition system specifications

Variable binding operators in transition system specifications (2001)

Cached

Download Links

by C. A. Middelburg

Citations:

BibTeX

@MISC{Middelburg01variablebinding,
    author = {C. A. Middelburg},
    title = { Variable binding operators in transition system specifications },
    year = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

2970	Communication and Concurrency - Milner - 1989
1263	The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
933	A calculus of mobile processes - Milner, Parrow, et al. - 1992
743	The Well-Founded Semantics for General Logic Programs - Gelder, Ross, et al. - 1991
641	Predicate logic as a programming language - Kowalski - 1974
216	Logic programming and negation: a survey - Apt, Bol - 1994
183	Structured operational semantics and bisimulation as a congruence - Groote, Vaandrager - 1992
169	Bisimulation Can’t Be Traced - Bloom, Istrael, et al. - 1995
152	Real time process algebra - Baeten, Bergstra - 1991
130	Abstract Syntax and Variable Binding - Fiore - 1999
124	Well-founded Semantics Coincides With Three-Valued Stable Semantics. Fundamenta informaticae, XIII - Przymusinski - 1990
107	Calculli for Higher Order Communicating Systems - Thomsen - 1990
103	A congruence theorem for structured operational semantics with predicates - Baeten, Verhoef - 1993
102	Proving congruence of bisimulation in functional programming languages - Howe - 1996
102	Structural operational semantics - Aceto, Fokkink, et al.
99	The algebra of timed process, ATP: Theory and application - Nicollin, Sifakis - 1994
98	The syntax and semantics of CRL - Groote, Ponse - 1990
75	Combinatory reduction systems: introduction and survey - Klop, Oostrom, et al. - 1993
69	The Meaning of Negative Premises in Transition System Specifications - Bol, Groote - 1996
58	Frege structures and the notion of proposition, truth and set - Aczel - 1980
58	R.: Higher-Level Synchronising Devices in Meije-SCCS - Simone - 1985
54	Ntyft/ntyxt rules reduce to ntree rules - Fokkink, Glabbeek - 1995
42	A Theory of Bisimulation for the -Calculus - Sangiorgi - 1993
36	Ageneral conservative extension theorem in process algebra - Verhoef - 1994
36	Concurrency and automata on in sequences - Park - 1981
35	The meaning of negative premises in transition system specifications II - Glabbeek - 1995
34	A congruence theorem for structured operational semantics of higher-order languages - Bernstein - 1998
33	Higher-level synchronising devices - Simone - 1985
29	A conservative look at operational semantics with variable binding - Fokkink, Verhoef - 1998
26	An interleaving model for real-time systems - Chen - 1992
25	Process algebra with timing: real time and discrete time - Baeten, Middelburg - 2001
20	A Kripke-Kleene semantics for general logic programs - Fitting - 1985
17	From SOS rules to proof principles: An operational metatheory for functional languages - Sands - 1997
14	Transition system speci with negative premises. Theoretical Computer Science 118 - Groote - 1993
11	Concurrency and automata on innite sequences - Park
10	time process algebra. Formal Aspects of Computing 3 - Baeten, Bergstra - 1991
7	CHOCOLATE: Calculi of higher order communication and lambda terms - Bloom - 1994
4	Transition system specications with negative premises - Groote - 1990
3	Comparison of process algebra equivalences using formats, in - Galpin - 1999
2	The syntax and semantics of l-CRL, in - Groote, Ponse - 1995
1	A theory of bisimulation for the p-calculus, Acta Informatica 33 - Sangiorgi - 1996
1	An algebraic generalization of Frege structures ± binding algebras, Theoret - SunYong - 1999