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
 · 
72 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Abstract Nominal logic is an extension of first-order logic with features useful for reasoning about abstract syntax with bound names. For computational applications such as programming and formal reasoning, it is desirable to develop constructive type theories for nominal logic which extend standard type theories for propositional, firstor higher-order logic. This has proven dicult, largely because of complex interactions between nominal logic’s name-abstraction operation and ordinary functional abstraction. This diculty,already arises in the case of propositional logic and simple type theory. In this paper we show how this diculty can be overcome, and present a simple nominal type theory which enjoys properties such as type soundness and strong normalization, and which can be soundly interpreted using existing nominal set models of nominal,logic. We also sketch how,recursion combinators for languages with binding structure can be provided. This is an important first step towards understanding the constructive content of nominal logic and incorporating it into existing constructive logics and type theories. Keywords: nominal terms, type systems
    Electr. Notes Theor. Comput. Sci. 01/2009; 228:37-52.
  • 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: 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

Full-text

View
0 Downloads