Term matching on parallel computers
From MaRDI portal
Publication:4203813
DOI10.1016/0743-1066(89)90014-9zbMath0685.68037OpenAlexW2064708943MaRDI QIDQ4203813
No author found.
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
parallel algorithmrewritingfunctional programmingEREWCRCWequational programmingCREWsymbol manipulations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Parallel tree pattern matching ⋮ A note on the parallel complexity of anti-unification ⋮ Efficient parallel term matching and anti-unification ⋮ Tight complexity bounds for term matching problems
This page was built for publication: Term matching on parallel computers
