Computational Paths -- An approach in the $LND_{EQ}-TRS_{2}$ system

Computational Paths -- An approach in the $LND_{EQ}-TRS_{2}$ system

We use a labelled deduction system ( LND$_{ED-}$TRS ) based on the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type, which allowed us to carry out in homotopic theory an approach using the concept of computational paths. From this, we show that...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Veras, Tiago M. L, Ramos, Arthur F, de Queiroz, Ruy J. G. B, de Oliveira, Anjolina G
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Logic in Computer Science
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We use a labelled deduction system ( LND$_{ED-}$TRS ) based on the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type, which allowed us to carry out in homotopic theory an approach using the concept of computational paths. From this, we show that the computational paths can be used to perform the proofs of the $LND_{EQ}-TRS_{2}$ rewriting system.
DOI:10.48550/arxiv.2007.07769