Conference Paper

A Dependent Type Theory with Names and Binding.

DOI: 10.1007/b100120 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 Bookmarks
 · 
77 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates a methodology of using FM (Fraenkel- Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a domain theory for con- currency within FM sets the domain theory inherits types and operations for name generation, essentially without disturbing its original higher- order features. The original domain theory had a metalanguage HOPLA (Higher Order Process Language) and accordingly this expands to a met- alanguage, Nominal HOPLA, with name generation (closely related to an earlier language new-HOPLA). Nominal HOPLA possesses an oper- ational and denotational semantics which are related via soundness and adequacy results, again carried out within FM sets.
    Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings; 01/2009
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Graph transformation has been used to model concurrent systems in software engineering, as well as in biochemistry and life sciences. The application of a transformation rule can be characterised algebraically as construction of a double-pushout (DPO) diagram in the category of graphs. We show how intuitionistic linear logic can be extended with resource-bound quantification, allowing for an implicit handling of the DPO conditions, and how resource logic can be used to reason about graph transformation systems.
    Electronic Proceedings in Theoretical Computer Science. 01/2010;
  • 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 01/2014; Volume 24(Issue 3):Pages 655-685. · 0.65 Impact Factor

Full-text

View
0 Downloads