Results 1 
4 of
4
Structural Operational Semantics
 Handbook of Process Algebra
, 1999
"... Structural Operational Semantics (SOS) provides a framework to give an operational semantics to programming and specification languages, which, because of its intuitive appeal and flexibility, has found considerable application in the theory of concurrent processes. Even though SOS is widely use ..."
Abstract

Cited by 148 (19 self)
 Add to MetaCart
Structural Operational Semantics (SOS) provides a framework to give an operational semantics to programming and specification languages, which, because of its intuitive appeal and flexibility, has found considerable application in the theory of concurrent processes. Even though SOS is widely used in programming language semantics at large, some of its most interesting theoretical developments have taken place within concurrency theory. In particular, SOS has been successfully applied as a formal tool to establish results that hold for whole classes of process description languages. The concept of rule format has played a major role in the development of this general theory of process description languages, and several such formats have been proposed in the research literature. This chapter presents an exposition of existing rule formats, and of the rich body of results that are guaranteed to hold for any process description language whose SOS is within one of these formats. As far as possible, the theory is developed for SOS with features like predicates and negative premises.
Full Abstraction for a Simple Parallel Programming Language
 LNCS
, 1979
"... In [Plol] a powerdomain was defined which was intended as a kind of analogue of the powerset construction, but for (certain kinds) of cpos. For example the powerdomain~(S±) of the flat cpo Si, formed from a set S, is the set {X! S~I(X#~) and ..."
Abstract

Cited by 100 (16 self)
 Add to MetaCart
In [Plol] a powerdomain was defined which was intended as a kind of analogue of the powerset construction, but for (certain kinds) of cpos. For example the powerdomain~(S±) of the flat cpo Si, formed from a set S, is the set {X! S~I(X#~) and
A Filter Model for Concurrent λCalculus
 SIAM J. COMPUT
, 1998
"... Type free lazy λcalculus is enriched with angelic parallelism and demonic nondeterminism. Callbyname and callbyvalue abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union ty ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Type free lazy λcalculus is enriched with angelic parallelism and demonic nondeterminism. Callbyname and callbyvalue abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union types and we prove that the induced logical semantics is fully abstract.
Degrees of Parallelism
, 1996
"... ion and the operator "!" associate to the right: x oe 1 1 ; x oe 2 2 ; . . . ; x oe n n :M or even more abridged ~x oe stands for x oe 1 1 :x oe 2 2 . . . x oe n n :M and (oe 1 ; . . . ; oe n ) stands for oe 1 !(oe 2 !(. . . !(oe n\Gamma1 !oe n ) . . .)). Define oe n for n ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ion and the operator "!" associate to the right: x oe 1 1 ; x oe 2 2 ; . . . ; x oe n n :M or even more abridged ~x oe stands for x oe 1 1 :x oe 2 2 . . . x oe n n :M and (oe 1 ; . . . ; oe n ) stands for oe 1 !(oe 2 !(. . . !(oe n\Gamma1 !oe n ) . . .)). Define oe n for n 2 N and oe 2 \Sigma by oe 0 := oe and oe n+1 := oe!oe n . ffl Instead of LM 1 . . . M n we mostly use the uncurrynotation L(M 1 ; . . . ; M n ). ffl Greek indices in the right upper corner stand for types. They are omitted, if the type of the term is evident or unmistakable. Obviously, each type can be written in the form oe = (oe 1 ; . . . ; oe n ; oe n+1 ) such that oe n+1 2 \Sigma 0 . 6 2 THE PROGRAMMING LANGUAGE PCF Definition 2.2 1. The set FV (M) of the free occuring variables in a term M is defined as follows: (a) For all x oe i 2 V set FV (x oe i ) := fx oe i g. (b) For all c 2 C set FV (c) := ;. (c) For all M oe!ø and N oe 2 (C ) set FV (MN) := FV (M) [ FV (N). (d) For...