TERM: A parallel executable graph reduction machine for equational language
From MaRDI portal
Publication:1823668
DOI10.1016/0167-8191(89)90060-4zbMath0681.68035OpenAlexW2094122760MaRDI QIDQ1823668
Kazuhito Ohmaki, Keiichi Ito, Satoru Tomura, Toshio Ito, Koji Torii, Katsuro Inoue
Publication date: 1989
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(89)90060-4
CCMequational logiccomputational modelparallel executionnon-procedural languageCongruence Closure Methodequational languagegraph reduction machine TERMimplementation features of TERM
Symbolic computation and algebraic computation (68W30) Theory of operating systems (68N25) Equational classes, universal algebra in model theory (03C05) Theory of software (68N99) Thue and Post systems, etc. (03D03)