Coinductive Interpreters for Process Calculi

نویسندگان

  • Luís Soares Barbosa
  • José Nuno Oliveira
چکیده

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 different ingredients present in the design of any such calculi. In particular structural aspects of the underlying behaviour model (e.g., the dichotomies such as active vs reactive, deterministic vs nondeterministic) become clearly separated from the interaction structure which defines the synchronisation discipline. The approach is illustrated by the detailed development in Charity of an interpreter for a family of process languages.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for -calculi ?

Coinductive (applicative) characterizations of various observational congruences which arise in the semantics of-calculus, for various reduction strategies, are discussed. Two semantic techniques for establishing the coincidence of the applicative and the contextual equivalences are analyzed. The rst is based on intersection types, the second is based on a mixed induction-coinduction principle.

متن کامل

A Uniform Syntactical Method for ProvingCoinduction Principles in - calculi ?

Coinductive characterizations of various observational con-gruences which arise in the semantics of-calculus, when-terms are evaluated according to various reduction strategies, are discussed. We analyze and extend to non-lazy strategies, both deterministic and non-deterministic, Howe's congruence candidate method for proving the coincidence of the applicative (bisimulation) and the contextual ...

متن کامل

Normal Bisimulations in Calculi with Passivation

Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterizations of barbed congruence, such as the notion of normal bisimulation developed by Sangiorgi for the higherorder π-calculus, are difficult to obtain. In this paper, we study bisimulations in two simple higher-order calculi w...

متن کامل

Centrum Voor Wiskunde En Informatica Reportrapport Behavioural Differential Equations: a Coinductive Calculus of Streams, Automata, and Power Series Behavioural Diierential Equations: a Coinductive Calculus of Streams, Automata, and Power Series

Streams, automata and languages, and formal power series are viewed coalgebraically. In summary , this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being nal. Finality then forms the basis for both deenitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive deenitions take the shape of what we h a v...

متن کامل

Standardization for the Coinductive Lambda-Calculus

In the calculus Λ of possibly non-wellfounded λ-terms, standardization is proved for a parallel notion of reduction. For this system confluence has recently been established by means of a bounding argument for the number of reductions provoked by the joining function which witnesses the confluence statement. Similarly, bounds have to be introduced in order to turn the proof of standardization f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002