Results 1  10
of
676,791
A picalculus semantics for an objectbased design notation
 Proceedings of CONCUR'93, LNCS 715
, 1993
"... Abstract. Companion papers give examples of the development of concurrent programs using a design notation which employs a number of concepts from objectoriented programming languages. This paper documents the semantics of the design language by providing a mapping to the picalculus. 1 ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
Abstract. Companion papers give examples of the development of concurrent programs using a design notation which employs a number of concepts from objectoriented programming languages. This paper documents the semantics of the design language by providing a mapping to the picalculus. 1
A Model for the piCalculus
, 1991
"... We develop a semantic theory based on testing for a minor variant of the ßcalculus. The resulting semantic equivalence can be characterised using of acceptance sets and can also be characterised as an equational theory. We define a class of interpretations for the ßcalculus and construct one whic ..."
Abstract

Cited by 42 (7 self)
 Add to MetaCart
We develop a semantic theory based on testing for a minor variant of the ßcalculus. The resulting semantic equivalence can be characterised using of acceptance sets and can also be characterised as an equational theory. We define a class of interpretations for the ßcalculus and construct one
The Polymorphic Picalculus: Theory and Implementation
, 1995
"... We investigate whether the πcalculus is able to serve as a good foundation for the design and implementation of a stronglytyped concurrent programming language. The first half of the dissertation examines whether the πcalculus supports a simple type system which is flexible enough to provide a su ..."
Abstract

Cited by 112 (0 self)
 Add to MetaCart
We investigate whether the πcalculus is able to serve as a good foundation for the design and implementation of a stronglytyped concurrent programming language. The first half of the dissertation examines whether the πcalculus supports a simple type system which is flexible enough to provide a
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
, encapsulation, and others. In a sense, Flogic stands in the same relationship to the objectoriented paradigm as classical predicate calculus stands to relational programming. Flogic has a modeltheoretic semantics and a sound and complete resolutionbased proof theory. A small number of fundamental concepts
WSCDL and PiCalculus
"... Abstract. With the publishing and creation of the Web Services Description Language (WSCDL) and the success of the Pi Calculus it has been stated that the former is based on the latter. A well reasoned answer for or against this claim is not to be found. Here an approach to a well reasoned answer i ..."
Abstract
 Add to MetaCart
Abstract. With the publishing and creation of the Web Services Description Language (WSCDL) and the success of the Pi Calculus it has been stated that the former is based on the latter. A well reasoned answer for or against this claim is not to be found. Here an approach to a well reasoned answer
A Structural Approach to Operational Semantics
, 1981
"... Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be ..."
Abstract

Cited by 1541 (3 self)
 Add to MetaCart
Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can
Behavioral Equivalence in the Polymorphic PiCalculus
 JOURNAL OF THE ACM
, 1997
"... We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manip ..."
Abstract

Cited by 65 (8 self)
 Add to MetaCart
We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly
Final Semantics for the picalculus
, 1998
"... In this paper we discuss final semantics for the calculus, a process algebra which models systems that can dynamically change the topology of the channels. We show that the final semantics paradigm, originated by Aczel and Rutten for CCSlike languages, can be successfully applied also here. This i ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
based on typed calculus. Such a presentation highlights the nature of the binding operators and elucidates the role of free and bound channels. The final semantics is defined making use of this higher order presentation, within a category of hypersets.
Results 1  10
of
676,791