Proof of the Subject Reduction Property for a Pi-Calculus in COQ

Loïc Henry-Gréard 1
1 MEIJE - Concurrency, Synchronization and Real-time Programming
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : This paper presents a method for coding pi-calculus in the COQ proof assistant- , in order to use this environment to formalize properties of the pi-calculus. This method consists in making a syntactic discrimination between free names (then called parameters) and bound names (then called variables) of the processes, so that implicit renamings of bound names are avoided in the substitution operation. This technique has been used by J.McKinna and R.Pollack in an extensive study of PTS [5]. We use this coding here to prove subject reduction property for a type system of a monadic pi-calculus.
Type de document :
RR-3698, INRIA. 1999
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:29:36
Dernière modification le : samedi 27 janvier 2018 - 01:31:31
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:29:53



  • HAL Id : inria-00072970, version 1



Loïc Henry-Gréard. Proof of the Subject Reduction Property for a Pi-Calculus in COQ. RR-3698, INRIA. 1999. 〈inria-00072970〉



Consultations de la notice


Téléchargements de fichiers