On the complexity of Bounded Second-Order Unification and Stratified Context Unification
From MaRDI portal
Publication:2889573
DOI10.1093/jigpal/jzq010zbMath1252.68160OpenAlexW2168518033MaRDI QIDQ2889573
Jordi Levy, Mateu Villaret, Manfred Schmidt-Schauss
Publication date: 8 June 2012
Published in: Logic Journal of IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/jzq010
Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatory logic and lambda calculus (03B40)
Related Items (3)
Congruence Closure of Compressed Terms in Polynomial Time ⋮ Linear pattern matching of compressed terms and polynomial rewriting ⋮ Parameter reduction and automata evaluation for grammar-compressed trees
This page was built for publication: On the complexity of Bounded Second-Order Unification and Stratified Context Unification