左线性重叠项重写系统的强序性

[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI:10.1109/LICS.1992.185540

Y. Toyama

{"title":"左线性重叠项重写系统的强序性","authors":"Y. Toyama","doi":"10.1109/LICS.1992.185540","DOIUrl":null,"url":null,"abstract":"G. Huet and J.J. Levy (INRIA Rep. 359, 1979) showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, index reduction strategy is normalizing. Their result is extended to overlapping term rewriting systems. It is shown that index reduction is normalizing for the class of strongly sequential left-linear term rewriting systems in which every critical pair can be joined with root balanced reductions. This class includes all weakly orthogonal left-normal systems, for which a leftmost-outermost reduction strategy is normalizing.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"30 1","pages":"274-284"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"Strong sequentiality of left-linear overlapping term rewriting systems\",\"authors\":\"Y. Toyama\",\"doi\":\"10.1109/LICS.1992.185540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"G. Huet and J.J. Levy (INRIA Rep. 359, 1979) showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, index reduction strategy is normalizing. Their result is extended to overlapping term rewriting systems. It is shown that index reduction is normalizing for the class of strongly sequential left-linear term rewriting systems in which every critical pair can be joined with root balanced reductions. This class includes all weakly orthogonal left-normal systems, for which a leftmost-outermost reduction strategy is normalizing.<<ETX>>\",\"PeriodicalId\":6412,\"journal\":{\"name\":\"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"30 1\",\"pages\":\"274-284\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1992.185540\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1992.185540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 41

摘要

G. Huet和J.J. Levy (INRIA Rep. 359, 1979)表明，对于每一个强序列正交(即左线性和非重叠)项重写系统，索引约简策略都是归一化的。将其结果推广到重叠项重写系统。证明了一类强序列左线性项重写系统的索引约简是规范化的，其中每个关键对都可以用根平衡约简连接。该类包括所有弱正交左正规系统，其中最左最外约简策略是归一化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Strong sequentiality of left-linear overlapping term rewriting systems

G. Huet and J.J. Levy (INRIA Rep. 359, 1979) showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, index reduction strategy is normalizing. Their result is extended to overlapping term rewriting systems. It is shown that index reduction is normalizing for the class of strongly sequential left-linear term rewriting systems in which every critical pair can be joined with root balanced reductions. This class includes all weakly orthogonal left-normal systems, for which a leftmost-outermost reduction strategy is normalizing.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量