...
首页> 外文期刊>Electronic Notes in Theoretical Computer Science >A Formalisation of Nominal α-equivalence with A and AC Function Symbols
【24h】

A Formalisation of Nominal α-equivalence with A and AC Function Symbols

机译:具有A和AC功能符号的名义α对等的形式化

获取原文

摘要

A formalisation of soundness of the notion of α -equivalence in nominal abstract syntax modulo associative (A) and associative-commutative (AC) equational theories is described. Initially, the notion of α -equivalence is specified based on a so called “weak” nominal relation as suggested by Urban in his nominal development in Isabelle/HOL. Then, it is formalised in Coq that this equality is indeed an equivalence relation. After that, general α -equivalence with A and AC function symbols is specified and formally proved to be an equivalence relation. As corollaries, the soundness α -equivalence modulo A and modulo AC is obtained. Finally, an algorithm for checking α -equivalence modulo A and AC is proposed. General α -equivalence problems are log-linearly solved while AC and the combination of A and AC α -equivalence problems have the same complexity as standard first-order approaches. This development is a first step towards verification of nominal matching, unification and narrowing algorithms modulo equational theories in general.
机译:描述了名义抽象句法模关联(A)和关联交换(AC)等式理论中α-等价概念的形式化。最初,α等效性的概念是根据Urban在Isabelle / HOL的名义发展中建议的所谓“弱”名义关系指定的。然后,在Coq中正式证明了这种平等确实是等价关系。之后,指定了带有A和AC功能符号的一般α-等价关系,并正式证明是等价关系。作为推论,获得了强度α-等价模A和模AC。最后,提出了一种检查α-等价模A和AC的算法。一般的α-等价问题可以对数线性求解,而AC以及A和AC的α-等价问题的组合具有与标准一阶方法相同的复杂性。这项发展是迈向验证名义匹配,统一和变窄算法等式理论的第一步。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号