Conference Paper

A Dependent Type Theory with Names and Binding.

DOI: 10.1007/978-3-540-30124-0_20 Conference: Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings
Source: DBLP

ABSTRACT We consider the problem of providing formal support for working with abstract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set theory how to address this through first-class names: in this paper we present a dependent type theory for programming and reasoning with such names. Our development is based on a categorical axiomatisation of names, with freshness as its central notion. An associated adjunction captures constructions known from FM theory: the freshness quantifier, name-binding, and unique choice of fresh names. The Schanuel topos – the category underlying FM set theory – is an instance of this axiomatisation. Working from the categorical structure, we define a dependent type theory which it models. This uses bunches to integrate the monoidal structure corresponding to freshness, from which we define novel multiplicative dependent products Π * and sums Σ * , as well as a propositions-as-types generalisation of the freshness quantifier.

0 Followers
 · 
110 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We introduce a system of linear dependent types, extended with quantifiers that ensure separation between distinct bound variables. Such variables may be interpreted as resources that can be accessed only locally. The main motivation for this system, is to make more manageable the logic encoding of specification formalisms based on graphs and state-transition models. The proof system is based on a sequent calculus presentation of quantified intuitionistic linear logic, relying on double-entry sequents. We prove the admissibility of cut, and show that this result can be used to prove subject reduction.
    Journal of Logic and Computation 06/2014; Volume 24(Issue 3):Pages 655-685. DOI:10.1093/logcom/exs026 · 0.50 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a logical framework based on the nominal approach to representing syntax with binders. First we extend nominal terms, which have a built-in name-abstraction operator and a first-order notion of sub-stitution for variables, with a capture-avoiding substitution operator for names. We then build a dependent type system for this extended syntax and show how it can be used to formalise systems with binding operators.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these attempts is completely satisfactory. In this article we develop a new sequent calculus for nominal logic in which the rules for the new- quantifier are much simpler than in previous attempts. We also prove several structural and metatheoretic properties, including cut-elimination, consistency, and equivalence to Pitts' axiomatization of nominal logic.
    Journal of Logic and Computation 12/2013; DOI:10.1093/logcom/exu024 · 0.50 Impact Factor

Preview (2 Sources)

Download
1 Download
Available from