Quasi-reductivity of Logically Constrained Term Rewriting Systems

2017/02/08 by Kop, Cynthia · 2 citations
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.1702.02397

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.

Cited by

• Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
• Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)

Related

• Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
• Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
• Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version)
• Generic Encodings of Constructor Rewriting Systems
• Proof Theory at Work: Complexity Analysis of Term Rewrite Systems