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

Tiago M. L. Veras; Arthur F. Ramos; Ruy J. G. B. de Queiroz; Anjolina G. de Oliveira

paper

Computational Paths -- An approach in the $L N D_{E Q} - T R S_{2}$ system

arXiv:2007.07769

Abstract

We use a labelled deduction system ( LND $_{E D -}$ 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 $L N D_{E Q} - T R S_{2}$ rewriting system.

21 pages. arXiv admin note: substantial text overlap with arXiv:1906.09105

Computational Paths -- An approach in the LNDEQ​−TRS2​ system

Abstract

Computational Paths -- An approach in the $L N D_{E Q} - T R S_{2}$ system