Counterexamples in Infinitary Rewriting with Non-Fully-Extended Rules

Ketema, Jeroen (2011) Counterexamples in Infinitary Rewriting with Non-Fully-Extended Rules. Information Processing Letters, 111 (13). pp. 642-646. ISSN 0020-0190

PDF
Restricted to UT campus only: Request a copy
243Kb

Abstract:	We show counterexamples exist to confluence modulo hypercollapsing subterms, fair normalisation, and the normal form property in orthogonal infinitary higher-order rewriting with non-fully-extended rules. This sets these systems apart from both fully-extended and finite systems, where no such counterexamples are possible.
Item Type:	Article
Copyright:	© 2011 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Formal Methods and Tools (FMT)
Link to this item:	http://purl.utwente.nl/publications/76651
Official URL:	http://dx.doi.org/10.1016/j.ipl.2011.04.001
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page