Proof by reflection in semantics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Proof by reflection in semantics

Yves Bertot


Conventional approach to describe the semantics of programming language usually rely on relations, in particular inductive relations. Simulating program execution then relies on proof search tools. We describe a functional approach to automate proofs about programming language semantics. Reflection is used to take facts from the context into account. The main contribution of this work is that we developed a systematic approach to describe and manipulate unknown expressions in the symbolic computation of programs for formal proof development. The tool we obtain is faster and more powerful than the conventional proof tools.
Fichier principal
Vignette du fichier
RR-5134.pdf (243.18 Ko) Télécharger le fichier

Dates and versions

inria-00071449 , version 1 (23-05-2006)


  • HAL Id : inria-00071449 , version 1


Kuntal das Barman, Yves Bertot. Proof by reflection in semantics. RR-5134, INRIA. 2004. ⟨inria-00071449⟩
75 View
286 Download


Gmail Facebook Twitter LinkedIn More