Term matching on parallel computers

DOI10.1016/0743-1066(89)90014-9MaRDI QIDQ4203813zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(89)90014-9

zbMATH Keywords

CRCWCREWequational programmingEREWfunctional programmingparallel algorithmrewritingsymbol manipulations

Mathematics Subject Classification ID

Theory of operating systems (68N25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 4047099
• Efficient parallel term matching and anti-unification
• On the sequential nature of unification
• scientific article; zbMATH DE number 4049127
• scientific article; zbMATH DE number 4090854

Cited in

(9)

• Tight complexity bounds for term matching problems
• scientific article; zbMATH DE number 4047099 (Why is no real title available?)
• scientific article; zbMATH DE number 4049127 (Why is no real title available?)
• Parallel Algorithms for Term Matching
• scientific article; zbMATH DE number 4090854 (Why is no real title available?)
• scientific article; zbMATH DE number 4126700 (Why is no real title available?)
• A note on the parallel complexity of anti-unification
• Efficient parallel term matching and anti-unification
• Parallel tree pattern matching

This page was built for publication: Term matching on parallel computers

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