A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL [chapter]

Simon J. Gay
2001 Lecture Notes in Computer Science  
We present a formalisation, in the theorem proving system Isabelle/HOL, of a linear type system for the pi calculus, including a proof of runtime safety of typed processes. The use of a uniform encoding of pi calculus syntax in a meta language, the development of a general theory of type environments, and the structured formalisation of the main proofs, facilitate the adaptation of the Isabelle theories and proof scripts to variations on the language and other type systems.
doi:10.1007/3-540-44755-5_16 fatcat:i6h4la3xyjemvfajisizdkknlm