• Media type: Text; Electronic Conference Proceeding; E-Article
  • Title: Abstract Clones for Abstract Syntax
  • Contributor: Arkor, Nathanael [Author]; McDermott, Dylan [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.FSCD.2021.30
  • Keywords: abstract clones ; simple type theories ; substitution ; free algebras ; second-order abstract syntax ; logical relations ; presentations ; induction ; variable binding
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: We give a formal treatment of simple type theories, such as the simply-typed λ-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional algebraic structure, one can further axiomatize second-order, variable-binding operators. This provides a syntax-independent representation of simple type theories. We describe multisorted second-order presentations, such as the presentation of the simply-typed λ-calculus, and their clone-theoretic algebras; free algebras on clones abstractly describe the syntax of simple type theories quotiented by equations such as β- and η-equality. We give a construction of free algebras and derive a corresponding induction principle, which facilitates syntax-independent proofs of properties such as adequacy and normalization for simple type theories. Working only with clones avoids some of the complexities inherent in presheaf-based frameworks for abstract syntax.
  • Access State: Open Access