Proof of the Subject Reduction Property for a Pi-Calculus in COQ - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1999

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

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3698.pdf (247.09 Ko) Télécharger le fichier

Dates and versions

inria-00072970 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072970 , version 1

Cite

Loïc Henry-Gréard. Proof of the Subject Reduction Property for a Pi-Calculus in COQ. RR-3698, INRIA. 1999. ⟨inria-00072970⟩
83 View
177 Download

Share

Gmail Facebook Twitter LinkedIn More