Despeyroux, J.: A higher-order speci cation of the pi-calculus. In IFIP International Conference on Theoretical Computer Science, IFIP TCS'2000, Sendai, Japan, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... relevant for the labelled transi tion semantics of process calculi such as the calculus and its relations [MPW92, AbG99, CaG00b] both because complicated forms of binding to do with names and names restriction play a key role there and because analyses based on name abstraction as functions [HMS98, Des00] are not entirely satisfactory. The formalism of permutation actions and nite support has been rediscovered independently by Honda in his work on a general framework for processes [Hon00] It also features in work on nite state transition systems for checking bisimilarity of calculus processes ....

Despeyroux, J.: A higher-order speci cation of the pi-calculus. In IFIP International Conference on Theoretical Computer Science, IFIP TCS'2000, Sendai, Japan, 2000.

....P Gamma ( x) xhvi)hdi j d(y) P Gamma dhvi j d(y) P Gamma Pf v =yg . We shall come back to this formulation when we discuss labeled bisimilarity in LHO, in Remark 6.2 of Section 6. A similar, functional, formulation can be given of L, as well as of other calculus like languages [9]. 5 Compiling higher order into rst order We show that the higher order calculus LHO can be faithfully compiled down into the rst order calculus L. This shows that the higher order features of LHO, although convenient from a programming point of view, do not add expressive power. The compilation ....

J. Despeyroux. Higher-order specication of the pi-calculus. In preparation, 1999.

....techniques are rst order in the sense that binders in the calculi are distinct from binders in the logic. J.Despeyroux has investigated a higher order approach in which the lambda abstraction of the logic is used for binding free variables of the calculus. see [DH94] for a general approach and [DS99] for applications on the calculus with Davide Sangiorgi. F.Honsel, M.Miculan and I.Scagnetto [FI98] have encoded a calculus in COQ a higher order approach they use Co inductive types in their encoding of bisimulation. 7 Conclusion and future work We have formalized an concurrent object ....

Jo#lle Despeyroux and Davide Sangiorgi. A higher-order specication of the pi-calculus. Draft, presented at the Modelisation and Verication seminar, Marseille, Dec 98, 1999.

....ff equivalence relation is the Leibnitz equality and the substitution functions can de dened as sets of partial rewriting rules on these terms. We prove induction schemes for both the terms and some properties of the calculus which internalize the renaming of bound variables . We show that, despite that the terms which formalize the calculus are not generated by a last xed point relation, we can prove the desire inversion lemmas. We formalize the computational part of the semantic and a simple type system of the calculus. At least, we prove a subject reduction theorem and see that ....

....rules on these terms. We prove induction schemes for both the terms and some properties of the calculus which internalize the renaming of bound variables . We show that, despite that the terms which formalize the calculus are not generated by a last xed point relation, we can prove the desire inversion lemmas. We formalize the computational part of the semantic and a simple type system of the calculus. At least, we prove a subject reduction theorem and see that the specications and proofs have the nice feature of not mixing de Bruijn technical manipulations with real proofs. 1 ....

[Article contains additional citation context not shown here]

Jo#lle Despeyroux. A higher-order specication of the pi-calculus. Presented at the Modelisation and Verication seminar, Marseille, Dec 98. Submitted for publication, March.

.... Semantics Focus Melham [14] HOL monadic names LTS Hirschko [9] Coq polyadic de Bruijn LTS Honsell et al. 11] Coq monadic HOAS LTS R ockl et al. 22] Isabelle HOL monadic HOAS syntax R ockl [21] Isabelle HOL monadic GP syntax Henry Gr eard [8] Coq monadic MP LTS Despeyroux [2] Coq monadic HOAS LTS This paper Isabelle HOL polyadic de Bruijn RED There are two main novelties of the formalisation reported in the present paper. First, we formalise an operational semantics based on a reduction relation rather than a labelled transition system; this is because the ....

J. Despeyroux. A higher-order specication of the pi-calculus. In Proceedings of the IFIP International Conference on Theoretical Computer Science, 2000.

.... ( or typing ( Author Prover Calculus Binding Semantics Focus Melham [10] HOL monadic names LTS Hirschko [5] Coq polyadic de Bruijn LTS Honsell et al. 7] Coq monadic HOAS LTS R ockl et al. 17] Isabelle HOL monadic HOAS syntax Henry Gr eard [4] Coq monadic MP LTS Despeyroux [1] Coq monadic HOAS LTS This paper Isabelle HOL polyadic de Bruijn RED 2 Pi Calculus We assue some familiarity with the pi calculus [13, 12] but summarise its syntax and semantics in this section. To de ne the syntax of the pi calculus, we assume an in nite set N of channel names, using n to ....

J. Despeyroux. A higher-order specication of the pi-calculus. In Proceedings of the IFIP International Conference on Theoretical Computer Science, 2000. To appear.

....consideration for publication in Math. Struct. in Comp. Science Recursion over Objects of Functional Type Jo#lle Despeyroux y and Pierre Leleu Received September 1999 This paper presents an extension of the simply typed calculus allowing iteration and case reasoning over terms of functional types that arise when using higher order abstract syntax. This calculus aims at being the kernel for a type theory in ....

....to formalize programming languages 17 7 Appendix B. A note on the modal core of the system 18 8 Appendix C. Interpretation of type A in the case A is pure 19 y INRIA, 2004 Route des Lucioles B.P. 93. F 06902 Sophia Antipolis Cedex, France. Joelle.Despeyroux sophia.inria.fr, LeleuP wanadoo.fr Jo#lle Despeyroux and Pierre Leleu 2 1. Introduction Higher order abstract syntax (PE88) is a representation technique which proves to be useful when modelizing in a logical framework a language which involves bindings of variables. Thanks to this technique, the formalization of an (object level) language does ....

[Article contains additional citation context not shown here]

Jo#lle Despeyroux. A higher-order specication of the pi-calculus. Submitted for publication, March 1999.

.... relevant for the labelled transition semantics of process calculi such as the calculus and its relations [MPW92, AG99, CG00b] both because complicated forms of binding to do with names and names restriction play a key role there and because analyses based on name abstraction as functions [HMS98, Des00] are not entirely satisfactory. The formalism of permutation actions and nite support has been rediscovered independently by Honda in his work on a general framework for processes [Hon00] It also features in work on nite state transition systems for checking bisimilarity of calculus processes ....

J. Despeyroux. A higher-order specication of the pi-calculus. In IFIP International Conference on Theoretical Computer Science, IFIP TCS'2000, Sendai, Japan, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC