A higher-order specification of the π-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1872 LNCS, Issue , 2000, Pages 425-439

  Despeyroux, Joelle ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); SIGNAL ENCODING; SPECIFICATIONS; THEOREM PROVING;

CALCULUS OF INDUCTIVE CONSTRUCTIONS; COQ SYSTEMS; HIGHER-ORDER; PI CALCULUS; TYPECHECKING;

CALCULATIONS;

EID: 23044518107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44929-9_30     Document Type: Conference Paper

References (22)

1. B. Barras, S. Boutin, C. Cornes, J. Courant, J.C. Filliatre, E. Gimenez, H. Herbelin, G. Huet, C. Munoz, C. Murthy, C. Parent, C. Paulin, A. Säbi, and B. Werner. The Coq Proof Assistant Reference Manual-Version V6.1. Technical Report 0203, INRIA, August 1997.
2. Gerard Boudol. The pi-calculus in direct style. In proceedings of the POPL ACM Conference on Principles of Programming Languages, pages 228-241, 1997.
3. Thierry Coquand and Gerard Huet. The calculus of constructions. Information and Computation, 76:95-120, 1988.
4. Joëlle Despeyroux and Pierre Leleu. A modal calcul with iteration and case constructs. In proceedings of the annual Types for Proofs and Programs seminar, Springer-Verlag LNCS 1657, March 1998. An extended and revised version will appear in the forthcoming special issue of MSCS on Intuitionistic Modal Logics and Applications.
5. Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. In Philippe de Groote and J. Roger Hindley, editors, proceedings of the TLCA 97 Int. Conference on Typed Lambda Calculi and Applications, Nancy, France, April 2-4, pages 147-163. Springer-Verlag LNCS 1210, April 1997. An extended version is available as CMU Technical Report CMU-CS-96-172. An extended and revised version will appear in TCS (Theoretical Computer Science).
6. Cfiedric Fournet, Georges Gonthier, Jean-Jacques Levy, Luc Maranget, and Didier Remy. A calculus of mobile agents. In Proc. of the CONCUR conference, 1996.
7. A. Gordon and P. Hankin. A concurrent object calculus: reduction and typing. In proceedings of the HLCL Conference, 1998.
8. Guillaume Gillard. A formalization of a concurrent object calculus up to alpha-conversion. In Proceedings of the 17th International Conference on Automated Deduction, CADE-17, June 2000.
9. A. Gordon. A mechanisation of name-carrying syntax up to alphaconversion. In proceedings of the int. workshop on Higher Order Logic Theorem Proving and its Applications, Vancouver, Springer-Verlag LNCS 780, pages 414-426, 1994.
10. Löc Henry Greard. A proof of type preservation for the pi-calculus in Coq. Research Report RR-3698, Inria, December 1998. Also available in the Coq Contrib library.
11. Daniel Hirschko-. A full formalization of pi-calculus theory in the Calculus of Constructions. In Elsa Gunter, editor, proceedings of the International Conference on Theorem Proving in Higher Order Logics, Murray Hill, New Jersey, August 1997.
12. Daniel Hirschko-. Mise en oeuvre de preuves de bisimulation. Phd thesis, Ecole Nationale des Ponts et Chaussees (ENPC), January 1999. In French.
13. Gerard Huet, Gilles Kahn, and Christine Paulin-Mohring. The coq proof assistant: A tutorial, version 6.1. Technical Report RT 0204, Inria, Rocquencourt, France, August 1997. page html: http://www.inria.fr/RRRT/RT-0204. html.
14. Furio Honsell, Marino Miculan, and Ivan Scagnetto. Pi-calculus in (co)Inductive Type Theory. to appear in TCS, 1999.
15. Martin Hofmann. Semantical analysis of higher-order abstract syntax. In IEEE, editor, proceedings of the International Conference on Logic In Computer Sciences, LICS, 1999.
16. Naoki Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20-2, December 1998. A preliminary summary appeared in LICS'97.
17. Robin Milner. The polyadic pi-calculus: A tutorial. Technical Report ECSLFCS-91-180, LFCS, Edinburgh University, October 1991.
18. Raymond McDowell and Dale Miller. A logic for reasoning with higherorder abstract syntax: An extended abstract. In Glynn Winskel, editor, Proceedings of the Twelfth Annual Symposium on Logic in Computer Science, Warsaw, Poland, June 1997. To appear.
19. R. Milner, R. Parrow, and J. Walker. A calculus of mobile processes, (part I and II). Information and Computation, 100:1-77, 1992.
20. Christine Paulin-Mohring. Inductive denitions in the system coq. rules and properties. In J.F. Groote M. Bezem, editor, Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA'93, Springer-Verlag LNCS 664, pages 328-345, 1992. also available as a Research Report RR-92-49, Dec. 1992, ENS Lyon, France.
21. Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 11, 1995.
22. Benjamin Pierce and David Turner. Pict: A programming language based on the pi-calculus. Technical Report ., IU, 1997.