{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T11:54:31Z","timestamp":1711972471870},"reference-count":51,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":[[1987,12]]},"DOI":"10.1016\/0167-739x(87)90030-6","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:30:38Z","timestamp":1060306238000},"page":"261-270","source":"Crossref","is-referenced-by-count":7,"title":["The dutch parallel reduction machine project"],"prefix":"10.1016","volume":"3","author":[{"given":"H.P.","family":"Barendregt","sequence":"first","affiliation":[]},{"given":"M.C.J.D.","family":"Van Eekelen","sequence":"additional","affiliation":[]},{"given":"M.J.","family":"Plasmeijer","sequence":"additional","affiliation":[]},{"given":"P.H.","family":"Hartel","sequence":"additional","affiliation":[]},{"given":"L.O.","family":"Hertzberger","sequence":"additional","affiliation":[]},{"given":"W.G.","family":"Vree","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-739X(87)90030-6_BIB1","article-title":"FP\/M abstract syntax description","author":"Bailey","year":"1984"},{"key":"10.1016\/0167-739X(87)90030-6_BIB2","series-title":"Functional Programming and the Language Tale","first-page":"122","volume":"224","author":"Barendregt","year":"1986"},{"key":"10.1016\/0167-739X(87)90030-6_BIB3","series-title":"Proceedings of Parallel Architectures and Languages Europe (PARLE), part II","first-page":"141","article-title":"Term graph reduction","volume":"259","author":"Barendregt","year":"1987"},{"key":"10.1016\/0167-739X(87)90030-6_BIB4","series-title":"Proceedings of Parallel Architectures and Languages Europe (PARLE), part II","first-page":"159","article-title":"Towards an intermediate language based on graph rewriting","volume":"259","author":"Barendregt","year":"1987"},{"key":"10.1016\/0167-739X(87)90030-6_BIB5","unstructured":"R.T. Boute, Functional description of digital systems, in: IFIP WG 10.1 Working Conference on Methodologies for Computer System Design (North-Holland, Amsterdam) 451\u2013467."},{"key":"10.1016\/0167-739X(87)90030-6_BIB6","series-title":"Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture (FPCA '87)","first-page":"364","article-title":"Clean, a language for functional graph rewriting","volume":"274","author":"Brus","year":"1987"},{"key":"10.1016\/0167-739X(87)90030-6_BIB7","series-title":"Proc. 1980 LISP Conference","first-page":"136","article-title":"Hope: an experimental applicative language","author":"Burstall","year":"1980"},{"key":"10.1016\/0167-739X(87)90030-6_BIB8","series-title":"Proc. 1980 ACM Lisp Conference","first-page":"128","article-title":"SKIM\u2014the S, K, I Reduction Machine","author":"Clarke","year":"1980"},{"key":"10.1016\/0167-739X(87)90030-6_BIB9","series-title":"Proc. Confer. Functional Languages and Computer Architecture","first-page":"50","article-title":"The categorical abstract machine","author":"Cousineau","year":"1985"},{"key":"10.1016\/0167-739X(87)90030-6_BIB10","series-title":"ACM Confer. functional programming, languages and computer architecture","first-page":"65","article-title":"ALICE: a multiple-processor reduction machine for the parallel evaluation of applicative languages","author":"Darlington","year":"1981"},{"key":"10.1016\/0167-739X(87)90030-6_BIB11","series-title":"Logic Programming: Functions, Relations and Equations","year":"1986"},{"key":"10.1016\/0167-739X(87)90030-6_BIB12","series-title":"Proceedings of the Workshop on Graph Reduction","article-title":"Specification of rewriting strategies in Term Rewriting Systems","volume":"279","author":"van Eekelen","year":"1986"},{"key":"10.1016\/0167-739X(87)90030-6_BIB13","series-title":"Proceedings of 12th ACM Symposium on Principles of Programming Languages (POPL '85)","first-page":"52","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985"},{"key":"10.1016\/0167-739X(87)90030-6_BIB14","article-title":"DACTL: a computational model and compiler target language based on graph reduction","author":"Glauert","year":"1987","journal-title":"ICL Techn. J."},{"key":"10.1016\/0167-739X(87)90030-6_BIB15","article-title":"The use of an abstract-interpretation TRS in specifying and proving reduction strategies","author":"Goos","year":"1987"},{"key":"10.1016\/0167-739X(87)90030-6_BIB16","article-title":"A load distribution network for a multi processor reduction machine","author":"Hartel","year":"1986"},{"key":"10.1016\/0167-739X(87)90030-6_BIB17","article-title":"Parallel graph reduction for divide-and-conquer applications","author":"Hartel","year":"1987"},{"key":"10.1016\/0167-739X(87)90030-6_BIB18","doi-asserted-by":"crossref","unstructured":"P.H. Hartel and A.H. Veen, Statistics on graph reduction of SASL programs, Software Pract. Exper.18 (3) 239\u2013253.","DOI":"10.1002\/spe.4380180305"},{"key":"10.1016\/0167-739X(87)90030-6_BIB19","article-title":"Experimental parallel reduction machine user manual","author":"Hartel","year":"1987"},{"key":"10.1016\/0167-739X(87)90030-6_BIB20","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TC.1985.6312191","article-title":"Distributed execution of functional programs using Serial combinators","author":"Hudak","year":"1985","journal-title":"IEEE Trans. Comput. C-34"},{"key":"10.1016\/0167-739X(87)90030-6_BIB21","series-title":"12th ACM Symp. on Principles of Programming Languages","first-page":"243","article-title":"Para-functional programming: a paradigm for programming multi-processor systems","author":"Hudak","year":"1986"},{"key":"10.1016\/0167-739X(87)90030-6_BIB22","series-title":"Proceedings of the Workshop on Graph Reduction","article-title":"Arrays, non-determinism, side-effects and parallelism: a functional perspective","volume":"279","author":"Hudak","year":"1986"},{"key":"10.1016\/0167-739X(87)90030-6_BIB23","article-title":"Graph reduction with super-combinators","author":"Hughes","year":"1982"},{"key":"10.1016\/0167-739X(87)90030-6_BIB24","article-title":"Interpreting lean","author":"Jansen","year":"1987"},{"key":"10.1016\/0167-739X(87)90030-6_BIB25","series-title":"Proc. ACM Sigplan '84","article-title":"Efficient compilation of lazy evaluation","volume":"19","author":"Johnsson","year":"1984"},{"key":"10.1016\/0167-739X(87)90030-6_BIB26","first-page":"613","article-title":"A loosely-coupled applicative multiprocessing system","volume":"48","author":"Keller","year":"1979"},{"key":"10.1016\/0167-739X(87)90030-6_BIB27","series-title":"Proc. Confer. Functional Languages and Computer Architecture","first-page":"1","article-title":"The G-machine: a fast, graph-reduction evaluator","author":"Kieburtz","year":"1985"},{"key":"10.1016\/0167-739X(87)90030-6_BIB28","unstructured":"J.W. Klop, Term rewriting systems, in: S. Abramsky, D.M. Gabbai, T.S.E. Maibuam, Eds., the Handbook of Logic in Computer Science, to appear."},{"key":"10.1016\/0167-739X(87)90030-6_BIB29","series-title":"Interner Bericht ISF-79-3","article-title":"The architecture of a reduction language machine hardware model","author":"Kluge","year":"1979"},{"key":"10.1016\/0167-739X(87)90030-6_BIB30","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1109\/TC.1983.1676151","article-title":"Cooperating reduction machines","author":"Kluge","year":"1983","journal-title":"IEEE Trans. Comput. C-32"},{"key":"10.1016\/0167-739X(87)90030-6_BIB31","doi-asserted-by":"crossref","unstructured":"P.W.M. Koopman, Interactive programs in a functional language: a functional implementation of an editor, Software Pract. Exper.17 (9) 609\u2013622.","DOI":"10.1002\/spe.4380170905"},{"key":"10.1016\/0167-739X(87)90030-6_BIB32","unstructured":"P.W.M. Koopman and E.G.J.M.H. Nocker, Compiling functional languages to functional graph rewriting systems, University of Nijmegen, to appear."},{"issue":"5","key":"10.1016\/0167-739X(87)90030-6_BIB33_1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00995174","article-title":"A network of microprocessors to execute reduction languages","volume":"8","author":"Mag\u00f3","year":"1979","journal-title":"Internat. J. Comput. Info. Sci."},{"issue":"6","key":"10.1016\/0167-739X(87)90030-6_BIB33_2","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/BF00995498","article-title":"A network of microprocessors to execute reduction languages","volume":"8","author":"Mag\u00f3","year":"1979","journal-title":"Internat. J. Comput. Info. Sci."},{"key":"10.1016\/0167-739X(87)90030-6_BIB34","article-title":"Tracing and debugging in SASL","author":"van der Lee","year":"1985"},{"key":"10.1016\/0167-739X(87)90030-6_BIB35","series-title":"Proceedings of Parallel Architectures and Languages Europe (PARLE)","first-page":"242","article-title":"Transputer-based experiments with the ZAPP architecture","volume":"258","author":"McBurney","year":"1987"},{"key":"10.1016\/0167-739X(87)90030-6_BIB36","article-title":"Abstract interpretation and optimising transformations for applicative programs","author":"Mycroft","year":"1981"},{"key":"10.1016\/0167-739X(87)90030-6_BIB37","unstructured":"E.G.J.M.H. Nocker, Strictness analysis for functional graph rewriting systems, University of Nijmegen, to appear."},{"key":"10.1016\/0167-739X(87)90030-6_BIB38","unstructured":"M.J. O'Donnell, Equational Logic as a Programming Language, Foundations of Computing Series MIT Press."},{"key":"10.1016\/0167-739X(87)90030-6_BIB39","article-title":"DOOM: A decentralized object-oriented machine","author":"Odijk","year":"1985"},{"key":"10.1016\/0167-739X(87)90030-6_BIB40","first-page":"67","article-title":"Using future bus in a fifth generation computer","volume":"10","author":"Peyton Jones","year":"1986"},{"key":"10.1016\/0167-739X(87)90030-6_BIB41","unstructured":"S.L. Peyton Jones, FLIC\u2014a Functional Language Intermediate Code, Dept. of Comp. Sci., University College London, internal working paper."},{"key":"10.1016\/0167-739X(87)90030-6_BIB42","article-title":"Strictheidsanalyse","author":"de Lavalette","year":"1986"},{"key":"10.1016\/0167-739X(87)90030-6_BIB43","unstructured":"G. Renardel de Lavalette, Strictness analysis for a language with polymorphic and recursive types, University of Utrecht, to appear."},{"key":"10.1016\/0167-739X(87)90030-6_BIB44","series-title":"Proc. Workshop on Implementation of Functional Languages","first-page":"429","article-title":"An overview of the burroughs NORMA","author":"Richards","year":"1985"},{"key":"10.1016\/0167-739X(87)90030-6_BIB45","series-title":"Proc. 9-th Internat. IEEE\/ACM Symp. Computer Architecture","first-page":"229","article-title":"A recursive computer for VLSI","author":"Treleaven","year":"1982"},{"issue":"1","key":"10.1016\/0167-739X(87)90030-6_BIB46","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 Pract. Exper."},{"key":"10.1016\/0167-739X(87)90030-6_BIB47","series-title":"Proc. Confer. Functional Languages and Computer Architecture","first-page":"1","article-title":"Miranda: a non-strict functional language with polymorphic types","author":"Turner","year":"1985"},{"key":"10.1016\/0167-739X(87)90030-6_BIB48","series-title":"Proc. Internat. Confer. Parallel Processing and Applications","article-title":"The grain size of parallel computations in a functional program","author":"Vree","year":"1987"},{"key":"10.1016\/0167-739X(87)90030-6_BIB49","article-title":"Semantics and Pragmatics of the Lambda-calculus","author":"Wadsworth","year":"1971"},{"key":"10.1016\/0167-739X(87)90030-6_BIB50","unstructured":"I. Watson, A packet based data-driven rewrite-rule machine, Department of Computer Science, University of Manchester."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X87900306?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X87900306?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T05:16:11Z","timestamp":1585113371000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167739X87900306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["0167739X87900306"],"URL":"https:\/\/doi.org\/10.1016\/0167-739x(87)90030-6","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}