Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Strongly typed term representations in Coq

Benton, Nick and Hur, Chung-Kil and Kennedy, Andrew and McBride, Conor (2012) Strongly typed term representations in Coq. Journal of Automated Reasoning, 49 (2). pp. 141-159. ISSN 0168-7433

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

There are two approaches to formalizing the syntax of typed object languages in a proof assistant or programming language. The extrinsic approach is to first define a type that encodes untyped object expressions and then make a separate definition of typing judgements over the untyped terms. The intrinsic approach is to make a single definition that captures well-typed object expressions, so ill-typed expressions cannot even be expressed. Intrinsic encodings are attractive and naturally enforce the requirement that metalanguage operations on object expressions, such as substitution, respect object types. The price is that the metalanguage types of intrinsic encodings and operations involve non-trivial dependency, adding significant complexity. This paper describes intrinsic-style formalizations of both simply-typed and polymorphic languages, and basic syntactic operations thereon, in the Coq proof assistant. The Coq types encoding object-level variables (de Bruijn indices) and terms are indexed by both type and typing environment. One key construction is the boot-strapping of definitions and lemmas about the action of substitutions in terms of similar ones for a simpler notion of renamings. In the simply-typed case, this yields definitions that are free of any use of type equality coercions. In the polymorphic case, some substitution operations do still require type coercions, which we at least partially tame by uniform use of heterogeneous equality.

Item type: Article
ID code: 41346
Keywords: Coq proof assistant, typed object languages , de Bruijn indices, Electronic computers. Computer science, Artificial Intelligence, Computational Theory and Mathematics, Software
Subjects: Science > Mathematics > Electronic computers. Computer science
Department: Faculty of Science > Computer and Information Sciences
Related URLs:
    Depositing user: Pure Administrator
    Date Deposited: 04 Oct 2012 14:29
    Last modified: 27 Mar 2014 10:32
    URI: http://strathprints.strath.ac.uk/id/eprint/41346

    Actions (login required)

    View Item