Heterogeneous Substitution Systems Revisited - Archive ouverte HAL Access content directly
Book Sections Year : 2018

Heterogeneous Substitution Systems Revisited

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.
Fichier principal
Vignette du fichier
AhrensMatthes-HetSubstSysRevisited-TYPES2015-LIPIcs-Postproc.pdf (611.14 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-02360681 , version 1 (13-11-2019)

Licence

Attribution

Identifiers

Cite

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⟩
70 View
72 Download

Altmetric

Share

Gmail Facebook X LinkedIn More