Complexity Analysis for Call-by-Value Higher-Order Rewriting
Logic in Computer Science
2023-07-26 v1
Abstract
In this short paper, we consider a form of higher-order rewriting with a call-by-value evaluation strategy so as to model call-by-value programs. We briefly present a cost-size semantics to call-by-value rewriting: a class of algebraic interpretations that map terms to tuples that bound both the reductions' cost and the size of normal forms.
Cite
@article{arxiv.2307.13426,
title = {Complexity Analysis for Call-by-Value Higher-Order Rewriting},
author = {Cynthia Kop and Deivid Vale},
journal= {arXiv preprint arXiv:2307.13426},
year = {2023}
}
Comments
Presented at WST 2023