Unification and matching on compressed terms

DOI10.1145/1970398.1970402zbMath1351.68128OpenAlexW2122839006MaRDI QIDQ2946645

Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauss

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1970398.1970402

zbMATH Keywords

term unificationcontext matchingsingleton tree grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Congruence Closure of Compressed Terms in Polynomial Time ⋮ Grammar-Based Tree Compression ⋮ Approximation of smallest linear tree grammar ⋮ Nominal Unification and Matching of Higher Order Expressions with Recursive Let ⋮ Linear pattern matching of compressed terms and polynomial rewriting ⋮ Parameter reduction and automata evaluation for grammar-compressed trees ⋮ Grammar-based compression of unranked trees ⋮ Nominal unification with letrec and environment-variables

This page was built for publication: Unification and matching on compressed terms