Pattern Unification for the Lambda Calculus with Linear and Affine Types
We define the pattern fragment for higher-order unification problems in linear and affine type theory and give a deterministic unification algorithm that computes most general unifiers.
cs.LO↗