Results 1  10
of
15
A New Approach to Abstract Syntax Involving Binders
 In 14th Annual Symposium on Logic in Computer Science
, 1999
"... Syntax Involving Binders Murdoch Gabbay Cambridge University DPMMS Cambridge CB2 1SB, UK M.J.Gabbay@cantab.com Andrew Pitts Cambridge University Computer Laboratory Cambridge CB2 3QG, UK ap@cl.cam.ac.uk Abstract The FraenkelMostowski permutation model of set theory with atoms (FMsets) ..."
Abstract

Cited by 145 (14 self)
 Add to MetaCart
Syntax Involving Binders Murdoch Gabbay Cambridge University DPMMS Cambridge CB2 1SB, UK M.J.Gabbay@cantab.com Andrew Pitts Cambridge University Computer Laboratory Cambridge CB2 3QG, UK ap@cl.cam.ac.uk Abstract The FraenkelMostowski permutation model of set theory with atoms (FMsets) can serve as the semantic basis of metalogics for specifying and reasoning about formal systems involving name binding, ffconversion, capture avoiding substitution, and so on. We show that in FMset theory one can express statements quantifying over `fresh' names and we use this to give a novel settheoretic interpretation of name abstraction. Inductively defined FMsets involving this nameabstraction set former (together with cartesian product and disjoint union) can correctly encode objectlevel syntax modulo ffconversion. In this way, the standard theory of algebraic data types can be extended to encompass signatures involving binding operators. In particular, there is an associated n...
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions
 ALGOLLIKE LANGUAGES
, 1997
"... The manipulation of objects with state which changes over time is allpervasive in computing. Perhaps the simplest example of such objects are the program variables of classical imperative languages. An important strand of work within the study of such languages, pioneered by John Reynolds, focusses ..."
Abstract

Cited by 101 (18 self)
 Add to MetaCart
The manipulation of objects with state which changes over time is allpervasive in computing. Perhaps the simplest example of such objects are the program variables of classical imperative languages. An important strand of work within the study of such languages, pioneered by John Reynolds, focusses on "Idealized Algol", an elegant synthesis of imperative and functional features. We present a novel semantics for Idealized Algol using games, which is quite unlike traditional denotational models of state. The model takes into account the irreversibility of changes in state, and makes explicit the difference between copying and sharing of entities. As a formal measure of the accuracy of our model, we obtain a full abstraction theorem for Idealized Algol with active expressions.
Presheaf Models for Concurrency
, 1999
"... In this dissertation we investigate presheaf models for concurrent computation. Our aim is to provide a systematic treatment of bisimulation for a wide range of concurrent process calculi. Bisimilarity is defined abstractly in terms of open maps as in the work of Joyal, Nielsen and Winskel. Their wo ..."
Abstract

Cited by 45 (19 self)
 Add to MetaCart
In this dissertation we investigate presheaf models for concurrent computation. Our aim is to provide a systematic treatment of bisimulation for a wide range of concurrent process calculi. Bisimilarity is defined abstractly in terms of open maps as in the work of Joyal, Nielsen and Winskel. Their work inspired this thesis by suggesting that presheaf categories could provide abstract models for concurrency with a builtin notion of bisimulation. We show how
Models for NamePassing Processes: Interleaving and Causal
 In Proceedings of LICS 2000: the 15th IEEE Symposium on Logic in Computer Science (Santa Barbara
, 2000
"... We study syntaxfree models for namepassing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual picalculus operations, defining Indexed Labelled Transition Systems. For noninterleaving causal semantics we de ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
We study syntaxfree models for namepassing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual picalculus operations, defining Indexed Labelled Transition Systems. For noninterleaving causal semantics we define Indexed Labelled Asynchronous Transition Systems, smoothly generalizing both our interleaving model and the standard Asynchronous Transition Systems model for CCSlike calculi. In each case we relate a denotational semantics to an operational view, for bisimulation and causal bisimulation respectively. We establish completeness properties of, and adjunctions between, categories of the two models. Alternative indexing structures and possible applications are also discussed. These are first steps towards a uniform understanding of the semantics and operations of namepassing calculi.
Presheaf Models for the piCalculus
, 1997
"... Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle systems where the language of actions may change dynamically as a process evolves. The example is the p ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle systems where the language of actions may change dynamically as a process evolves. The example is the picalculus, a calculus for `mobile processes' whose communication topology varies as channels are created and discarded. A denotational semantics is described for the picalculus within an indexed category of profunctors; the model is fully abstract for bisimilarity, in the sense that bisimulation in the model, obtained from open maps, coincides with the usual bisimulation obtained from the operational semantics of the picalculus. While attention is concentrated on the `late' semantics of the picalculus, it is indicated how the `early' and other variants can also be captured.
A Filter Model for Mobile Processes
 MATH. STRUCT. IN COMP. SCIENCE
, 1993
"... This paper presents a filter model for πcalculus, and shows its full abstraction with respect to a "may" operational semantics. The model is introduced in the form of a type assignment system. Types are related by a preorder which mimics the operational behaviour of terms. A subject expansion th ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
This paper presents a filter model for πcalculus, and shows its full abstraction with respect to a "may" operational semantics. The model is introduced in the form of a type assignment system. Types are related by a preorder which mimics the operational behaviour of terms. A subject expansion theorem holds. Terms are interpreted as filters of types: this interpretation is compositional. The proof of full abstraction relies on a notion of realizability of types, and on the construction of terms, which test when an arbitrary term has a fixed type.
Stream Based Specification of Mobile Systems
 Formal Aspects of Computing
, 1999
"... . This paper introduces a formal specification technique for mobile systems based on input/output relations on streams. We consider networks of components communicating asynchronously via unbounded directed channels. Mobility is achieved by allowing the components to communicate channel ports. We di ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. This paper introduces a formal specification technique for mobile systems based on input/output relations on streams. We consider networks of components communicating asynchronously via unbounded directed channels. Mobility is achieved by allowing the components to communicate channel ports. We distinguish between manytomany and two variants of pointtopoint communication. The communication paradigms are semantically underpinned by denotational models. The models are formulated in the context of timed nondeterministic dataflow networks and presented in a stepwise fashion. The emphasis is on capturing the special kind of dynamic hiding characterizing mobile systems. We demonstrate the proposed approach in a number of small examples. 1. Introduction Motivated by the need to model objectoriented programming languages and openness in distributed applications, the study of mobile systems has become a very popular research area. Most of the early theoretical research on mobility is...
A πcalculus process semantics of concurrent idealised ALGOL
 In Proc. FOSSACS'99, volume 1578 of LNCS
, 1999
"... We study the use of the πcalculus for semantical descriptions of languages such as Concurrent Idealised ALGOL (CIA), combining imperative, functional and concurrent features. We first present an operational semantics for CIA, given by SOS rules and a contextual form of behavioural equivalence; th ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We study the use of the πcalculus for semantical descriptions of languages such as Concurrent Idealised ALGOL (CIA), combining imperative, functional and concurrent features. We first present an operational semantics for CIA, given by SOS rules and a contextual form of behavioural equivalence; then a πcalculus semantics. As behavioural equivalence on πcalculus processes we choose the standard (weak early) bisimilarity. We compare the two semantics, demonstrating that there is a close operational correspondence between them and that the πcalculus semantics is sound. This allows for applying thecalculus theory in proving behavioural properties of CIA phrases. We discuss laws and examples which have served as benchmarks to various semantics, and a more complex example involving procedures of higher order.
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 2 (2 self)
 Add to MetaCart
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 is achieved by suitably generalizing the standard techniques so as to accommodate the mechanism of name creation and the behaviour of the binding operators peculiar to the calculus. As a preliminary step, we give a higher order presentation of the calculus using as metalanguage LF , a logical framework 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.
On Behavioural Interpretation of Types in Name Passing Calculi (extended )
"... We introduce a theory of behavioural types as a semantic foundation of typed ßcalculi. In this theory, a type is a set of behaviours, represented by early name passing synchronisation trees, which conform to a certain behavioural constraint. Operations on typed processes are derived from typed vari ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce a theory of behavioural types as a semantic foundation of typed ßcalculi. In this theory, a type is a set of behaviours, represented by early name passing synchronisation trees, which conform to a certain behavioural constraint. Operations on typed processes are derived from typed variants of wellknown processtheoretic operations for mobile processes, and each model of typed ßcalculi in a typed universe induces a compositional theory of typed bisimilarities. The construction is simple and intuitive, yet offers a rich class of typed universes of name passing interactive behaviours, which contain, among others, models of known typed ßcalculi and universes of game semantics. As a simple but nontrivial application, we show how the sorting by Milner can be given a sound model in a basic universe of types. The soundness states not only that the interpretation is sound in the standard sense, but also that the untyped interactive behaviour of typed terms is justifiable on t...