Results 1 
6 of
6
AN ALGEBRA OF FIXPOINTS FOR CHARACTERIZING INTERACTIVE BEHAVIOR OF INFORMATION SYSTEMS
, 2001
"... ..."
Coinductive Interpreters for Process Calculi
 In Sixth International Symposium on Functional and Logic Programming, volume 2441 of LNCS
, 2002
"... This paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. The proposed approach is independent of any particular process calculus and makes explicit the dierent ingredients present in the design of any such calculi. In partic ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
This paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. The proposed approach is independent of any particular process calculus and makes explicit the dierent ingredients present in the design of any such calculi. In particular structural aspects of the underlying behaviour model become clearly separated from the interaction structure which de nes the synchronisation discipline. The approach is illustrated by the detailed development in Charity of an interpreter for a family of process languages.
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.
Modeling Fresh Names in the πcalculus Using Abstractions
, 2004
"... In this paper, we model fresh names in the #calculus using abstractions with respect to a new binding operator #. Both the theory and the metatheory of the #calculus benefit from this simple extension. The operational semantics of this new calculus is finitely branching. Bisimulation can be given ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, we model fresh names in the #calculus using abstractions with respect to a new binding operator #. Both the theory and the metatheory of the #calculus benefit from this simple extension. The operational semantics of this new calculus is finitely branching. Bisimulation can be given without mentioning any constraint on names, thus allowing for a straightforward definition of a coalgebraic semantics, within a category of coalgebras over permutation algebras. Following previous work by Montanari and Pistore, we present also a finite representation for finitary processes and a finite state verification procedure for bisimilarity, based on the new notion of #automaton.
Comparing HigherOrder Encodings in Logical Frameworks and Tile Logic
, 2001
"... In recent years, logical frameworks and tile logic have been separately proposed by our research groups, respectively in Udine and in Pisa, as suitable metalanguages with higherorder features for encoding and studying nominal calculi. This paper discusses the main features of the two approaches, tr ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
In recent years, logical frameworks and tile logic have been separately proposed by our research groups, respectively in Udine and in Pisa, as suitable metalanguages with higherorder features for encoding and studying nominal calculi. This paper discusses the main features of the two approaches, tracing di#erences and analogies on the basis of two case studies: late #calculus and lazy simply typed #calculus.
Bisimulations upto: beyond firstorder transition systems
"... Abstract. The bisimulation proof method can be enhanced by employing ‘bisimulations upto ’ techniques. A comprehensive theory of such enhancements has been developed for firstorder (i.e., CCSlike) labelled transition systems (LTSs) and bisimilarity, based on the notion of compatible function for ..."
Abstract
 Add to MetaCart
Abstract. The bisimulation proof method can be enhanced by employing ‘bisimulations upto ’ techniques. A comprehensive theory of such enhancements has been developed for firstorder (i.e., CCSlike) labelled transition systems (LTSs) and bisimilarity, based on the notion of compatible function for fixedpoint theory. We transport this theory onto languages whose bisimilarity and LTS go beyond those of firstorder models. The approach consists in exhibiting fully abstract translations of the more sophisticated LTSs and bisimilarities onto the firstorder ones. This allows us to reuse directly the large corpus of upto techniques that are available on firstorder LTSs. The only ingredient that has to be manually supplied is the compatibility of basic upto techniques that are specific to the new languages. We investigate the method on the picalculus, the λcalculus, and a (callbyvalue) λcalculus with references. 1