Turchin's Relation and Subsequence Relation in Loop Approximation

13 pages•Published: July 28, 2014

Abstract

The paper studies the subsequence relation through a notion of an intransitive binary relation on words in traces generated by prefix-rewriting systems. The relation was introduced in 1988 by V.F. Turchin for loop approximation in supercompilation. We study properties of this relation and introduce some refinements of the subsequence relation that inherit the useful features of Turchin's relation.

Keyphrases: almost well relation, higman embedding, loop approximation, program transformation, supercompilation

In: Irina Virbitskaite and Andrei Voronkov (editors). PSI 2014. Ershov Informatics Conference, vol 23, pages 30-42.

Links:	https://easychair.org/publications/paper/vJxn
	https://doi.org/10.29007/xqx9

BibTeX entry

@inproceedings{PSI2014:Turchins_Relation_Subsequence_Relation,
  author    = {Antonina Nepeivoda},
  title     = {Turchin's Relation and Subsequence Relation in Loop Approximation},
  booktitle = {PSI 2014. Ershov Informatics Conference},
  editor    = {Irina Virbitskaite and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {23},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/vJxn},
  doi       = {10.29007/xqx9},
  pages     = {30-42},
  year      = {2014}}

Download PDF Open PDF in browser