The calculus of nominal inductive constructions: an intensional approach to encoding name-bindings

  • Authors:

  • Edwin Westbrook;Aaron Stump;Evan Austin

  • Affiliations:

  • Rice University;The University of Iowa;The University of Kansas

  • Venue:
  • Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Although name-bindings are ubiquitous in computer science, they are well-known to be cumbersome to encode and reason about in logic and type theory. There are many proposed solutions to this problem in the literature, but most of these proposals, however, have been extensional, meaning they are defined in terms of other concepts in the theory. This makes it difficult to apply these proposals in intensional theories like the Calculus of Inductive Constructions, or CIC. In this paper, we introduce an approach to encoding name-bindings that is intensional, as it attempts to capture the meaning of a name-binding in itself. This approach combines in a straightforward manner with CIC to form the Calculus of Nominal Inductive Constructions, or CNIC. CNIC supports induction over data containing bindings, comparing of names for equality, and associating meta-language types with names in a fashion similar to HOAS, features which have been shown difficult to support in practice.