Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking.

Julien Narboux
Christian Urban
  • Function : Author
  • PersonId : 843508

Abstract

In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning method of logical relations in a case study about equivalence checking. He presents a type-driven equivalence checking algorithm and verifies its completeness with respect to a definitional characterisation of equivalence. We present in this paper a formalisation of Crary's proof using Isabelle/HOL and the nominal datatype package.
Fichier principal
Vignette du fichier
lfmtp-07.pdf (118.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00180061 , version 1 (17-10-2007)
inria-00180061 , version 2 (29-06-2010)

Identifiers

Cite

Julien Narboux, Christian Urban. Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking.. LFMTP'07, Jul 2007, Bremen, Germany. 15p., ⟨10.1016/j.entcs.2007.09.014⟩. ⟨inria-00180061v2⟩
26 View
134 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More