Lazy linear combinatorial unification

DOI10.1006/JSCO.1998.0248MaRDI QIDQ1284282zbMATH OpenOpenAlexFDO

Authors Marco Bellia, M. Eugenia Occhiuto

Publication date 30 March 1999

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b940c1c3db2ac94e9d0a466836272f55fb63a3e2

zbMATH Keywords

lazy computation of unification on first-order termstwo-rule reduction system

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic programming (68N17) Grammars and rewriting systems (68Q42)

Recommendations

• A practically efficient and almost linear unification algorithm
• On the sequential nature of unification
• scientific article; zbMATH DE number 3986672
• Delaying unification algorithms for lambda calculi
• scientific article; zbMATH DE number 4060709

Cited in

(2)

• scientific article; zbMATH DE number 3986672 (Why is no real title available?)
• Uniform Lazy Narrowing

This page was built for publication: Lazy linear combinatorial unification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284282)