首页    期刊浏览 2024年11月29日 星期五
登录注册

文章基本信息

  • 标题:Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification
  • 本地全文:下载
  • 作者:Gert Smolka ; Tobias Tebbi
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2013
  • 卷号:21
  • 页码:271-286
  • DOI:10.4230/LIPIcs.RTA.2013.271
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:A recursion scheme is an orthogonal rewriting system with rules of the form f(x1,...,xn) -> s. We consider terms to be equivalent if they rewrite to the same redex-free possibly infinite term after infinitary rewriting. For the restriction to the nonnested case, where nested redexes are forbidden, we prove the existence of principal unifiers modulo scheme equivalence. We give an algorithm computing principal unifiers by reducing the problem to a novel fragment of semi-unification we call anchored semi-unification. For anchored semi-unification, we develop a decision algorithm that returns a principal semi-unifier in the positive case.
  • 关键词:recursion schemes; semi-unification; infinitary rewriting
国家哲学社会科学文献中心版权所有