For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Bulletin- European Association for Theoretical Computer Science Year : 1992

For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable.

Domains

Programming Languages [cs.PL]

Rémi Gilleron  : Connect in order to contact the contributor

https://inria.hal.science/inria-00538877

Submitted on : Tuesday, November 23, 2010-2:48:08 PM

Last modification on : Friday, May 17, 2024-4:32:06 PM

No file

Dates and versions

inria-00538877 , version 1 (23-11-2010)

Identifiers

  • HAL Id : inria-00538877 , version 1

Cite

Sandor Vágvölgyi, Rémi Gilleron. For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable.. Bulletin- European Association for Theoretical Computer Science, 1992, 48, pp.197--209. ⟨inria-00538877⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-LILLE3 CNRS INRIA LIFL
131 View
0 Download

Share

Gmail Facebook X LinkedIn More