Higher-order term indexing using substitution trees

DOI10.1145/1614431.1614437zbMath1351.68064OpenAlexW2105146990MaRDI QIDQ2946592

Brigitte Pientka

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/1614431.1614437

zbMATH Keywords

indexingtype theorylogical frameworks

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Higher-order pattern anti-unification in linear time ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Higher-order pattern generalization modulo equational theories ⋮ One or nothing: anti-unification over the simply-typed lambda calculus ⋮ Restricted combinatory unification ⋮ A Generic Framework for Higher-Order Generalizations.

Uses Software

• Twelf

This page was built for publication: Higher-order term indexing using substitution trees