Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems
The notion of normal forms is ubiquitous in various equivalent transformations. Confluence (CR), one of the central properties of term rewriting systems (TRSs), concerns uniqueness of normal forms. Yet another such property, which is weaker than confluence, is the property of unique normal forms w.r.t. conversion (UNC). Recently, automated confluence proof of TRSs has caught attentions; some powerful confluence tools integrating multiple methods for (dis)proving the CR property of TRSs have been developed. In contrast, there have been little efforts on (dis)proving the UNC property automatically yet. In this paper, we report on a UNC prover combining several methods for (dis)proving the UNC property. We present an equivalent transformation of TRSs preserving UNC, as well as some new criteria for (dis)proving UNC.
Thanks are due to the anonymous reviewers of the previous versions of the paper. This work is partially supported by JSPS KAKENHI No. 18K11158.
- 1.Aoto, T., Toyama, Y.: Top-down labelling and modularity of term rewriting systems. Research Report IS-RR-96-0023F, School of Information Science, JAIST (1996)Google Scholar
- 10.Kahrs, S., Smith, C.: Non-\(\omega \)-overlapping TRSs are UN. In: Proceedings of 1st FSCD. LIPIcs, vol. 52, pp. 22:1–22:17. Schloss Dagstuhl (2016)Google Scholar
- 12.Klop, J.: Combinatory Reduction Systems, Mathematical Centre Tracts, vol. 127. CWI, Amsterdam (1980)Google Scholar
- 18.Rapp, F., Middeldorp, A.: Automating the first-order theory of rewriting for left-linear right-ground rewrite systems. In: Proceedings of 1st FSCD. LIPIcs, vol. 52, pp. 36:1–36:17. Schloss Dagstuhl (2016)Google Scholar
- 19.Toyama, Y.: Commutativity of term rewriting systems. In: Fuchi, K., Kott, L. (eds.) Programming of Future Generation Computers II, North-Holland, pp. 393–407 (1988)Google Scholar
- 20.Toyama, Y.: Confluent term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, p. 1. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-32033-3_1. Slides at http://www.nue.ie.niigata-u.ac.jp/toyama/user/toyama/slides/toyama-RTA05.pdfCrossRefzbMATHGoogle Scholar
- 21.Toyama, Y., Oyamaguchi, M.: Conditional linearization of non-duplicating term rewriting systems. IEICE Trans. Inf. Syst. E84-D(4), 439–447 (2001)Google Scholar