2000 character limit reached
Nominal Unification of Higher Order Expressions with Recursive Let (1608.03771v1)
Published 12 Aug 2016 in cs.PL and cs.LO
Abstract: 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.