دورية أكاديمية
أعرض في EDS

Term Graph Rewriting and Parallel Term Rewriting

التفاصيل البيبلوغرافية
العنوان: Term Graph Rewriting and Parallel Term Rewriting
المؤلفون: Andrea Corradini, Frank Drewes
المصدر: Electronic Proceedings in Theoretical Computer Science, Vol 48, Iss Proc. TERMGRAPH 2011, Pp 3-18 (2011)
بيانات النشر: Open Publishing Association, 2011.
سنة النشر: 2011
المجموعة: LCC:Mathematics
LCC:Electronic computers. Computer science
مصطلحات موضوعية: Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95
الوصف: The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the "sequential interpretation", a term graph reduction corresponds to an infinite sequence of term reductions, as formalized by Kennaway et.al. using strongly converging derivations over the complete metric space of infinite terms. Instead according to the "parallel interpretation" a term graph reduction corresponds to the parallel reduction of an infinite set of redexes in a rational term. We formalize the latter notion by exploiting the complete partial order of infinite and possibly partial terms, and we stress that this interpretation allows to explain the result of reducing circular redexes in several approaches to term graph rewriting.
نوع الوثيقة: article
وصف الملف: electronic resource
اللغة: English
تدمد: 2075-2180
Relation: http://arxiv.org/pdf/1102.2651v1; https://doaj.org/toc/2075-2180
DOI: 10.4204/EPTCS.48.3
URL الوصول: https://doaj.org/article/0bab18039d714a8c8751f824fc3d3fb4
رقم الأكسشن: edsdoj.0bab18039d714a8c8751f824fc3d3fb4
قاعدة البيانات: Directory of Open Access Journals
الوصف
تدمد:20752180
DOI:10.4204/EPTCS.48.3