arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.06233cs.LOcs.CLcs.PL
收藏

构造函数重写系统的泛型编码

Generic Encodings of Constructor Rewriting Systems

Université de Lorraine(洛林大学);LORIA(洛林计算机科学及其应用实验室)

Horatiu Cirstea, Pierre-Etienne Moreau

摘要:

重写是一种广泛应用于计算机科学和数理逻辑的形式主义。经典的形式主义已经扩展,在函数式语言的上下文中,与规则的顺序,并在基于重写的语言的上下文中,与模式的否定。本文提出了一种简洁明了的模式差异计算算法,该算法可用于将具有否定和顺序的构造函数项重写系统的通用编码定义为经典项重写系统。作为一个直接的后果,建立的方法用于长期重写系统可以应用到分析的扩展系统的属性。该方法也可以被看作是一个通用的编译器,其目标是提供基本模式匹配原语的任何语言。形式主义也提供了一个新的方法来决定一组模式是否包含一个给定的模式,从而检查无用模式的存在或模式的完整性。

英文摘要:

Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages, with the negation over patterns. We propose in this paper a concise and clear algorithm computing the difference over patterns which can be used to define generic encodings of constructor term rewriting systems with negation and order into classical term rewriting systems. As a direct consequence, established methods used for term rewriting systems can be applied to analyze properties of the extended systems. The approach can also be seen as a generic compiler which targets any language providing basic pattern matching primitives. The formalism provides also a new method for deciding if a set of patterns subsumes a given pattern and thus, for checking the presence of useless patterns or the completeness of a set of patterns.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑