Quasi-reductivity of Logically Constrained Term Rewriting Systems
Logic in Computer Science
2017-02-27 v1
Abstract
This paper considers quasi-reductivity - essentially, the property that an evaluation cannot get "stuck" due to a missing case in pattern matching - in the context of term rewriting with logical constraints.
Cite
@article{arxiv.1702.02397,
title = {Quasi-reductivity of Logically Constrained Term Rewriting Systems},
author = {Cynthia Kop},
journal= {arXiv preprint arXiv:1702.02397},
year = {2017}
}
Comments
arXiv admin note: text overlap with arXiv:1409.0166