A Categorical Semantics for Linear Logical Frameworks

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are developed, the latter in terms of (strict) indexed symmetric monoidal categories with comprehension. Various optional type formers are treated in a modular way. In particular, we will see that the historically much-debated multiplicative quantifiers and identity types arise naturally from categorical considerations. These new multiplicative connectives are further characterised by several identities relating them to the usual connectives from dependent type theory and linear logic. Finally, one important class of models, given by families with values in some symmetric monoidal category, is investigated in detail.
    Original languageEnglish
    Title of host publicationFoundations of Software Science and Computation Structures
    Subtitle of host publication18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings
    EditorsAndrew Pitts
    Place of PublicationBerlin, Heidelberg
    PublisherSpringer
    Pages102-116
    Number of pages15
    Edition1
    ISBN (Electronic)978-3-662-46678-0
    ISBN (Print)978-3-662-46677-3
    DOIs
    Publication statusPublished - 9 Apr 2015

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume9034

    Fingerprint

    Dive into the research topics of 'A Categorical Semantics for Linear Logical Frameworks'. Together they form a unique fingerprint.

    Cite this