{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T05:41:36Z","timestamp":1649050896193},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1989,7]]},"DOI":"10.1016\/0167-8191(89)90060-4","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"1-16","source":"Crossref","is-referenced-by-count":0,"title":["TERM: A parallel executable graph reduction machine for equational language"],"prefix":"10.1016","volume":"11","author":[{"given":"Kazuhito","family":"Ohmaki","sequence":"first","affiliation":[]},{"given":"Satoru","family":"Tomura","sequence":"additional","affiliation":[]},{"given":"Katsuro","family":"Inoue","sequence":"additional","affiliation":[]},{"given":"Toshio","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Keiichi","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Koji","family":"Torii","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/0167-8191(89)90060-4_BIB1","doi-asserted-by":"crossref","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the von Neuman style? A functional style and its algebra of programs","volume":"21","author":"Backus","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(89)90060-4_BIB2","series-title":"Proc. 1981 Conference on Functional Programming Languages and Computer Architecture","first-page":"65","article-title":"ALICE: A multi-processor reduction machine for a parallel evaluation of applicative languages","author":"Darlington","year":"1981"},{"key":"10.1016\/0167-8191(89)90060-4_BIB3","article-title":"The hashnet interconnection scheme","author":"Fahlman","year":"1980","journal-title":"CMU CS Report, CMU-CS-80-125"},{"key":"10.1016\/0167-8191(89)90060-4_BIB4","series-title":"Proc. 12th ACM Symposium of Principles of Programming Languages","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985"},{"key":"10.1016\/0167-8191(89)90060-4_BIB5","series-title":"Proc. IFIP Congress 80","article-title":"Specification writing as construction of hierarchically structured clusters of operators","author":"Futatsugi","year":"1980"},{"key":"10.1016\/0167-8191(89)90060-4_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/357153.357158","article-title":"Programming with equations","volume":"4","author":"Hoffman","year":"1982","journal-title":"ACM Trans. Programming Language Systems"},{"key":"10.1016\/0167-8191(89)90060-4_BIB7","series-title":"Proc. International Workshop on High-Level Language Computer Architecture","first-page":"174","article-title":"An architecture for direct execution of reduction languages","author":"Kluge","year":"1980"},{"key":"10.1016\/0167-8191(89)90060-4_BIB8","series-title":"Proc. IFIP Congress 74","article-title":"Predicate logic as programming language","author":"Kowalski","year":"1974"},{"issue":"5","key":"10.1016\/0167-8191(89)90060-4_BIB9_1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00995174","article-title":"A network of microprocessors to execute reduction languages, Part I","volume":"8","author":"Mago","year":"1979","journal-title":"J. Comput. Inform. Sci."},{"issue":"6","key":"10.1016\/0167-8191(89)90060-4_BIB9_2","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/BF00995498","article-title":"A network of microprocessor to execute reduction languages, Part II","volume":"8","author":"Mago","year":"1979","journal-title":"J. Comput. Inform. Sci."},{"key":"10.1016\/0167-8191(89)90060-4_BIB10","doi-asserted-by":"crossref","DOI":"10.1145\/322186.322198","article-title":"Fast decision procedure based on congruence closure","volume":"27","author":"Nelson","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(89)90060-4_BIB11","article-title":"Control software and execution time of a term rewriting machine - TERM - based on the congruence relation","author":"Ohmaki","year":"1984"},{"issue":"1","key":"10.1016\/0167-8191(89)90060-4_BIB12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/356869.356873","article-title":"Data-driven and demand-driven computer architecture","volume":"14","author":"Treleaven","year":"1982","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0167-8191(89)90060-4_BIB13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","article-title":"A new implementation technique for applicative languages","volume":"9","author":"Turner","year":"1979","journal-title":"Software - Practice and Experiences"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900604?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900604?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:24:59Z","timestamp":1551086699000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189900604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["0167819189900604"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90060-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}