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

Abstract: 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.