Benedikt Ahrens ; André Hirschowitz ; Ambroise Lafont ; Marco Maggesi - Presentable signatures and initial semantics

lmcs:5136 - Logical Methods in Computer Science, May 26, 2021, Volume 17, Issue 2 -
Presentable signatures and initial semanticsArticle

Authors: Benedikt Ahrens ORCID; André Hirschowitz ; Ambroise Lafont ; Marco Maggesi ORCID

    We present a device for specifying and reasoning about syntax for datatypes, programming languages, and logic calculi. More precisely, we study a notion of "signature" for specifying syntactic constructions. In the spirit of Initial Semantics, we define the "syntax generated by a signature" to be the initial object -- if it exists -- in a suitable category of models. In our framework, the existence of an associated syntax to a signature is not automatically guaranteed. We identify, via the notion of presentation of a signature, a large class of signatures that do generate a syntax. Our (presentable) signatures subsume classical algebraic signatures (i.e., signatures for languages with variable binding, such as the pure lambda calculus) and extend them to include several other significant examples of syntactic constructions. One key feature of our notions of signature, syntax, and presentation is that they are highly compositional, in the sense that complex examples can be obtained by gluing simpler ones. Moreover, through the Initial Semantics approach, our framework provides, beyond the desired algebra of terms, a well-behaved substitution and the induction and recursion principles associated to the syntax. This paper builds upon ideas from a previous attempt by Hirschowitz-Maggesi, which, in turn, was directly inspired by some earlier work of Ghani-Uustalu-Hamana and Matthes-Uustalu. The main results presented in the paper are computer-checked within the UniMath system.

    Volume: Volume 17, Issue 2
    Published on: May 26, 2021
    Accepted on: March 19, 2021
    Submitted on: January 30, 2019
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Programming Languages
      Source : OpenAIRE Graph
    • A theory of type theories; Funder: UK Research and Innovation; Code: EP/T000252/1
    • Coq for Homotopy Type Theory; Funder: European Commission; Code: 637339

    1 Document citing this article

    Consultation statistics

    This page has been seen 1169 times.
    This article's PDF has been downloaded 199 times.