Loop detection in term rewriting using the eliminating unfoldings

Etienne Payet

doi:10.1016/J.TCS.2008.05.013

Journal Articles Theoretical Computer Science Year : 2008

Loop detection in term rewriting using the eliminating unfoldings

(1)

1

Etienne Payet

Function : Author
PersonId : 1243814
IdHAL : etienne-payet
ORCID : 0000-0002-3519-025X

Laboratoire d'Informatique et de Mathématiques

Keywords

Term-rewriting systems Non-termination Loop Unfolding

Domains

Logic in Computer Science [cs.LO]

Fichier principal

EtiennePayet.pdf (320.37 Ko)

Origin	Files produced by the author(s)

Etienne Payet : Connect in order to contact the contributor

https://hal.univ-reunion.fr/hal-04502927

Submitted on : Wednesday, March 13, 2024-2:21:02 PM

Last modification on : Tuesday, September 3, 2024-1:56:20 PM

Long-term archiving on : Friday, June 14, 2024-7:19:03 PM

Dates and versions

hal-04502927 , version 1 (13-03-2024)

Identifiers

HAL Id : hal-04502927 , version 1
DOI : 10.1016/J.TCS.2008.05.013

Cite

Etienne Payet. Loop detection in term rewriting using the eliminating unfoldings. Theoretical Computer Science, 2008, 403 (2-3), pp.307-327. ⟨10.1016/J.TCS.2008.05.013⟩. ⟨hal-04502927⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

AFRIQ UNIV-REUNION LIM PAPANGUE FST-REUNION

9 View

9 Download

Loop detection in term rewriting using the eliminating unfoldings

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share