Turchin's Relation for Call-by-Name Computations: A Formal Approach
Programming Languages
2016-07-11 v1 Logic in Computer Science
Abstract
Supercompilation is a program transformation technique that was first described by V. F. Turchin in the 1970s. In supercompilation, Turchin's relation as a similarity relation on call-stack configurations is used both for call-by-value and call-by-name semantics to terminate unfolding of the program being transformed. In this paper, we give a formal grammar model of call-by-name stack behaviour. We classify the model in terms of the Chomsky hierarchy and then formally prove that Turchin's relation can terminate all computations generated by the model.
Cite
@article{arxiv.1607.02230,
title = {Turchin's Relation for Call-by-Name Computations: A Formal Approach},
author = {Antonina Nepeivoda},
journal= {arXiv preprint arXiv:1607.02230},
year = {2016}
}
Comments
In Proceedings VPT 2016, arXiv:1607.01835