Dedukti的新重写引擎
The New Rewriting Engine of Dedukti
摘要:
Dedukti是$λ$ $Π$的类型检查器-演算模重写,爱丁堡的逻辑框架LF的扩展,其中函数和类型符号可以通过重写规则定义。它包含一个根据用户给出的重写规则重写LF术语和类型的引擎,该引擎的一个关键组件是找到哪些规则可以被触发的匹配算法。本文描述了Dedukti支持的重写规则类和匹配算法的新实现。Dedukti支持使用组合归约系统(CRS)中的高阶模式匹配对具有绑定的术语进行非线性重写规则。新的匹配算法将Luc Maranget在OCaml编译器中引入的决策树技术扩展到更一般的环境中。
英文摘要:
Dedukti is a type-checker for the $λ$$Π$-calculus modulo rewriting, an extension of Edinburgh's logicalframework LF where functions and type symbols can be defined by rewrite rules. It thereforecontains an engine for rewriting LF terms and types according to the rewrite rules given by the user.A key component of this engine is the matching algorithm to find which rules can be fired. In thispaper, we describe the class of rewrite rules supported by Dedukti and the new implementation ofthe matching algorithm. Dedukti supports non-linear rewrite rules on terms with binders usinghigher-order pattern-matching as in Combinatory Reduction Systems (CRS). The new matchingalgorithm extends the technique of decision trees introduced by Luc Maranget in the OCamlcompiler to this more general context.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。