HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:29:36 AM
Last modification on : Friday, February 4, 2022 - 3:15:28 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:29:53 PM


  • 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⟩



Record views


Files downloads