Heterogeneous substitution systems revisited

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Authors

Colleges, School and Institutes

External organisations

  • INRIA Rennes-Bretagne Atlantique, Nantes, France
  • CNRS & Université de Toulouse, Toulouse, France

Abstract

Matthes and Uustalu (TCS 327(1–2):155–174, 2004) presented a categorical description of substitution systems capable of capturing syntax involving binding which is independent of whether the syntax is made up from least or greatest fixed points. We extend this work in two directions: we continue the analysis by creating more categorical structure, in particular by organizing substitution systems into a category and studying its properties, and we develop the proofs of the results of the cited paper and our new ones in UniMath, a recent library of univalent mathematics formalized in the Coq theorem prover.

Details

Original languageEnglish
Title of host publication21st International Conference on Types and Proofs and Programs - TYPES 2015 - Postproceedings
EditorsTarmo Uustalu
Publication statusPublished - 16 Feb 2018
Event21st International Conference on Types and Proofs and Programs (TYPES 2015) - Tallinn, Estonia
Duration: 18 May 201521 May 2015

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl
Volume69
ISSN (Electronic)1868-8969

Conference

Conference21st International Conference on Types and Proofs and Programs (TYPES 2015)
CountryEstonia
CityTallinn
Period18/05/1521/05/15

Keywords

  • formalization of category theory, nested datatypes, Mendler-style recursion schemes, representation of substitution in languages with variable binding