Matching, unification and complexity

DOI10.1145/36330.36332zbMath0626.68036OpenAlexW2115857898MaRDI QIDQ3030252

Deepak Kapur, Paliath Narendran

Publication date: 1987

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

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

zbMATH Keywords

unificationpattern matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract data types; algebraic specification (68Q65)

Related Items (10)

Complexity of matching problems ⋮ A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties ⋮ Automated mutual induction proof in separation logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Complexity of unification problems with associative-commutative operators ⋮ Variant Narrowing and Equational Unification ⋮ A formalisation of nominal C-matching through unification with protected variables ⋮ Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) ⋮ Formalising nominal C-unification generalised with protected variables

This page was built for publication: Matching, unification and complexity