高阶表达式与递归式的名义统一
Nominal Unification of Higher Order Expressions with Recursive Let
摘要:
一个健全的和完整的算法,名义统一的高阶表达式与递归让描述,并运行在非确定性多项式时间。我们还探讨了专门的名义字母匹配的普通表达式和DAG,并确定相应的统一问题的复杂性。
英文摘要:
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for plain expressions and for DAGs and determine the complexity of corresponding unification problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。