In this paper an order-theoretic denotational semantics for a small programming language is defined. The main result is that this denotational semantics is a sound and complete model for the equational theory of the language. As an immediate corollary we obtain that two process terms are bisimular if and only if they are denotationally equal. 1
|
2791
|
Communication and Concurrency
– Milner
- 1989
|
|
1083
|
A Calculus of Communicating Systems
– Milner
- 1982
|
|
1072
|
A structural approach to operational semantics
– Plotkin
- 1981
|
|
306
|
Process algebra for synchronous communication
– Bergstra, Klop
- 1984
|
|
303
|
Introduction to Higher Order Categorical Logic
– Lambek, Scott
- 1986
|
|
192
|
Algebra of communicating processes with abstraction
– Bergstra, Klop
- 1985
|
|
187
|
Domain Theory in Logical Form
– Abramsky
- 1987
|
|
186
|
Structured operational semantics and bisimulation as a congruence
– Groote, Vaandrager
- 1992
|
|
170
|
A powerdomain construction
– Plotkin
- 1976
|
|
141
|
The category-theoretic solution of recursive domain equations
– Smyth, Plotkin
- 1982
|
|
127
|
Semantic domains
– Gunter, Scott
- 1990
|
|
108
|
Continuous lattices
– Scott
- 1972
|
|
105
|
A domain equation for bisimulation
– Abramsky
- 1991
|
|
93
|
Process Algebra, volume 18 of Cambridge Tracts
– Baeten, Weijland
- 1990
|
|
88
|
Full abstraction for a simple parallel programming language
– Hennessy, Plotkin
- 1979
|
|
72
|
F.W.: Turning SOS rules into equations
– Aceto, Bloom, et al.
- 1994
|
|
68
|
Power Domains
– Smyth
|
|
61
|
Processes and the denotational semantics of concurrency
– Bakker, Zucker
- 1982
|
|
53
|
post-graduate lecture notes in advanced domain theory (incorporating the 'Pisa notes
– Plotkin, Domains
- 1992
|
|
44
|
On the Foundations of Final Semantics: non-standard sets, metric spaces, partial orders
– Rutten, Turi
- 1993
|
|
38
|
Concurrent processes and their syntax
– Milne, Milner
- 1979
|
|
21
|
Processes as terms: non-well-founded models for bisimulation
– Rutten
- 1992
|
|
8
|
Comparative metric semantics for concurrent prolog
– Bakker, Kok
- 1990
|
|
8
|
Deriving denotational models for bisimulation from Structured Operational Semantics
– Rutten
- 1990
|
|
7
|
Algebraic Techniques for Concurrency and their Application
– Vaandrager
- 1989
|
|
4
|
Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
– Meyer, Zucker
- 1988
|
|
4
|
Algebraic domains, chain completion and the Plotkin powerdomain construction
– Knijnenburg
- 1993
|
|
3
|
Order-theoretic and Categorical Approaches to Programming Language Semantics
– Knijnenburg
- 1993
|
|
3
|
The importance of the left merge operator
– Moller
- 1990
|
|
3
|
Logic and Structure (2nd Edition
– Dalen
- 1983
|
|
1
|
Homomorphism from LTS's to de Bakker-Zucker domain. Unpublished manuscript
– Horita
- 1989
|
|
1
|
Guarded structured operational semantics induce complete denotational models. Submitted to
– Knijnenburg
- 1993
|
|
