Skip to Main content Skip to Navigation
Book sections

Heterogeneous Substitution Systems Revisited

Benedikt Ahrens 1 Ralph Matthes 2, 3 
1 GALLINETTE - Gallinette : vers une nouvelle génération d'assistant à la preuve
Inria Rennes – Bretagne Atlantique , LS2N - Laboratoire des Sciences du Numérique de Nantes
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.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02360681
Contributor : Ralph Matthes Connect in order to contact the contributor
Submitted on : Wednesday, November 13, 2019 - 2:03:21 AM
Last modification on : Friday, August 5, 2022 - 2:54:52 PM
Long-term archiving on: : Friday, February 14, 2020 - 1:24:55 PM

File

AhrensMatthes-HetSubstSysRevis...
Publisher files allowed on an open archive

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Benedikt Ahrens, Ralph Matthes. Heterogeneous Substitution Systems Revisited. Tarmo Uustalu. 21st International Conference on Types for Proofs and Programs (TYPES 2015), 69, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp.2:1-2:23, 2018, Leibniz International Proceedings in Informatics (LIPIcs), 978-3-95977-030-9. ⟨10.4230/LIPIcs.TYPES.2015.2⟩. ⟨hal-02360681⟩

Share

Metrics

Record views

51

Files downloads

47