Nominal Abstraction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2011

Nominal Abstraction

Abstract

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such descriptions: the interpretation of atomic judgments through recursive definitions and an encoding of binding constructs via generic judgments. However, logics encompassing these two features do not currently allow for the definition of relations that embody dynamic aspects related to binding, a capability needed in many reasoning tasks. We propose a new relation between terms called nominal abstraction as a means for overcoming this deficiency. We incorporate nominal abstraction into a rich logic also including definitions, generic quantification, induction, and co-induction that we then prove to be consistent. We present examples to show that this logic can provide elegant treatments of binding contexts that appear in many proofs, such as those establishing properties of typing calculi and of arbitrarily cascading substitutions that play a role in reducibility arguments.
Fichier principal
Vignette du fichier
nominal-abstraction.pdf (389.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00772606 , version 1 (10-01-2013)

Identifiers

  • HAL Id : hal-00772606 , version 1

Cite

Gacek Andrew, Dale Miller, Gopalan Nadathur. Nominal Abstraction. Information and Computation, 2011, 209 (1), pp.48-73. ⟨hal-00772606⟩
162 View
76 Download

Share

Gmail Facebook X LinkedIn More