{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:36:36Z","timestamp":1648884996495},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0167-739x(92)90065-j","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T11:12:00Z","timestamp":1062587520000},"page":"303-319","source":"Crossref","is-referenced-by-count":0,"title":["Parallel associative combinator evaluation II"],"prefix":"10.1016","volume":"8","author":[{"given":"Martin","family":"Waite","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bret","family":"Giddings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Lavington","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-739X(92)90065-J_BIB1","article-title":"Two fundamental issues in multiprocessing","author":"Arvind","year":"1987"},{"key":"10.1016\/0167-739X(92)90065-J_BIB2","series-title":"Proc. PARLE (Parallel Languages and Architectures, Europe) Conf.","article-title":"Executing a program on the tagged-token dataflow architecture","author":"Arvind","year":"1987"},{"key":"10.1016\/0167-739X(92)90065-J_BIB3","series-title":"Version 0.99 of LML","author":"Augustsson","year":"1990"},{"issue":"5","key":"10.1016\/0167-739X(92)90065-J_BIB4","doi-asserted-by":"crossref","DOI":"10.1093\/comjnl\/32.5.461","article-title":"Principles for the design of a distributed memory architecture for parallel graph reduction","volume":"32","author":"Bevan","year":"1989","journal-title":"Comput. J."},{"key":"10.1016\/0167-739X(92)90065-J_BIB5","series-title":"Proc. ACM Lisp Conf.","article-title":"SKIM - the S K I reduction machine","author":"Clarke","year":"1980"},{"issue":"3","key":"10.1016\/0167-739X(92)90065-J_BIB6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/spe.4380180305","article-title":"Statistics on graph reduction of SASL programs","volume":"18","author":"Hartel","year":"1988","journal-title":"Software - Practice and Experience"},{"key":"10.1016\/0167-739X(92)90065-J_BIB7","series-title":"Pacetool: A monitoring tool for PACE","author":"Heaton","year":"1990"},{"key":"10.1016\/0167-739X(92)90065-J_BIB8","series-title":"The design and implementation of programming languages","author":"Hughes","year":"1983"},{"key":"10.1016\/0167-739X(92)90065-J_BIB9","series-title":"Parallel Processing and Applications","first-page":"399","article-title":"Combinator reduction on a parallel G-machine","author":"Nocker","year":"1988"},{"key":"10.1016\/0167-739X(92)90065-J_BIB10","series-title":"Functional Programming Languages and Computer Architecture","article-title":"GRIP: A high performance architecture for parallel graph reduction","author":"Peyton-Jones","year":"1987"},{"issue":"2","key":"10.1016\/0167-739X(92)90065-J_BIB11","doi-asserted-by":"crossref","DOI":"10.1093\/comjnl\/32.2.175","article-title":"Parallel implementations of functional programming languages","volume":"32","author":"Peyton-Jones","year":"1989","journal-title":"Computer J."},{"key":"10.1016\/0167-739X(92)90065-J_BIB12","series-title":"Proc. ACM SIGPLAN '84, Symp. on Compiler Construction","article-title":"Efficient compilation of lazy evaluation","volume":"19","author":"Johnsson","year":"1984"},{"key":"10.1016\/0167-739X(92)90065-J_BIB13","series-title":"Workshop on Implementation of Functional Languages on Parallel Architectures","article-title":"Some experiments in controlling the dynamic behaviour of parallel functional programs","author":"Sargeant","year":"1991"},{"key":"10.1016\/0167-739X(92)90065-J_BIB14","series-title":"Proc. ACM Conf. on Lisp and Functional Programming","article-title":"NORMA - a graph reduction processor","author":"Scheevel","year":"1986"},{"key":"10.1016\/0167-739X(92)90065-J_BIB15","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 Experience"},{"key":"10.1016\/0167-739X(92)90065-J_BIB16","series-title":"Parallel data-driven graph reduction","author":"Watson","year":"1985"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9290065J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9290065J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T06:53:44Z","timestamp":1551077624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167739X9290065J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["0167739X9290065J"],"URL":"https:\/\/doi.org\/10.1016\/0167-739x(92)90065-j","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}