Nominal Unification and Matching of Higher Order Expressions with Recursive Let

02/16/2021
by   Manfred Schmidt-Schauß, et al.
0

A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in nondeterministic polynomial time. We also explore specializations like nominal letrec-matching for expressions, for DAGs, and for garbage-free expressions and determine their complexity. Finally, we also provide a nominal unification algorithm for higher-order expressions with recursive let and atom-variables, where we show that it also runs in nondeterministic polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/05/2020

Superposition for Lambda-Free Higher-Order Logic

We introduce refutationally complete superposition calculi for intention...
01/23/2018

Higher-Order Equational Pattern Anti-Unification [Preprint]

We consider anti-unification for simply typed lambda terms in associativ...
11/19/2019

Robust Learning of Discrete Distributions from Batches

Let d be the lowest L_1 distance to which a k-symbol distribution p can ...
02/17/2020

On Higher-Order Cryptography (Long Version)

Type-two constructions abound in cryptography: adversaries for encryptio...
03/14/2019

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques

Regular expressions with backreferences (regex, for short), as supported...
01/03/2022

let (rec) insertion without Effects, Lights or Magic

Let insertion in program generation is producing code with definitions (...
05/24/2014

Geometric Polynomial Constraints in Higher-Order Graph Matching

Correspondence is a ubiquitous problem in computer vision and graph matc...