{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:12:33Z","timestamp":1649142753092},"reference-count":72,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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":[[1991,9]]},"DOI":"10.1016\/0167-739x(91)90005-i","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T11:40:25Z","timestamp":1062589225000},"page":"355-372","source":"Crossref","is-referenced-by-count":2,"title":["On function languages and parallel computers"],"prefix":"10.1016","volume":"6","author":[{"given":"Amos R","family":"Omondi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-739X(91)90005-I_BIB1","series-title":"Proc. 2nd Internat. Symp. on Computer Architecture","first-page":"133","article-title":"Reduction languages for reduction machines","author":"Berkling","year":"1975"},{"key":"10.1016\/0167-739X(91)90005-I_BIB2","series-title":"CASE Center Technical Report No. 8724","article-title":"System architectures for functional programming languages","author":"Berkling","year":"1987"},{"issue":"3","key":"10.1016\/0167-739X(91)90005-I_BIB3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(86)90014-2","article-title":"The relation between logic and functional programming: a survey","volume":"3","author":"Bellia","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0167-739X(91)90005-I_BIB4","series-title":"Computer Architecture","author":"Blaauw","year":"1991"},{"key":"10.1016\/0167-739X(91)90005-I_BIB5","series-title":"The Mythical Man-Month","author":"Brooks","year":"1975"},{"key":"10.1016\/0167-739X(91)90005-I_BIB6","series-title":"A Course in Universal Algebra","author":"Burris","year":"1981"},{"issue":"1","key":"10.1016\/0167-739X(91)90005-I_BIB7","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"Some transformations for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0167-739X(91)90005-I_BIB8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/31.3.243","article-title":"Nondeterminism with referential transparency in functional languages","volume":"31","author":"Burton","year":"1988","journal-title":"Comput. J"},{"key":"10.1016\/0167-739X(91)90005-I_BIB9","series-title":"Proc. Conf. on Functional Languages and Computer Architecture","first-page":"350","article-title":"Transforming recursive programs for execution on parallel machines","author":"Bush","year":"1985"},{"key":"10.1016\/0167-739X(91)90005-I_BIB10","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0167-739X(91)90005-I_BIB11","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"key":"10.1016\/0167-739X(91)90005-I_BIB12","series-title":"Distributed Computing","first-page":"79","article-title":"Logic programming and Prolog","author":"Clocksin","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB13","series-title":"Parallel Execution of Logic Programs","author":"Conery","year":"1987"},{"key":"10.1016\/0167-739X(91)90005-I_BIB14","series-title":"Technical Report","article-title":"CLOCS Architecture Reference Manual","author":"Davis","year":"1987"},{"key":"10.1016\/0167-739X(91)90005-I_BIB15","series-title":"Functional Programming and Its Applications","first-page":"193","article-title":"Program transformation","author":"Darlington","year":"1982"},{"key":"10.1016\/0167-739X(91)90005-I_BIB16","series-title":"Distributed Computing","first-page":"57","article-title":"Functional programming","author":"Darlington","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB17","series-title":"Logic Programming: Functions, Relations, and Equations","first-page":"37","article-title":"The unification of functional and logic languages","author":"Darlington","year":"1986"},{"issue":"2","key":"10.1016\/0167-739X(91)90005-I_BIB18","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(85)80003-6","article-title":"Computing with rewrite rules","volume":"65","author":"Dershowitz","year":"1985","journal-title":"Inform. Control"},{"key":"10.1016\/0167-739X(91)90005-I_BIB19","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminacy, and formal derivation of programs","volume":"18","author":"Dijkstra","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/0167-739X(91)90005-I_BIB20","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-739X(91)90005-I_BIB21","series-title":"Fundamentals of Algebraic Specifications I: Equations and Initial Semantics","author":"Ehrig","year":"1985"},{"issue":"9","key":"10.1016\/0167-739X(91)90005-I_BIB22","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/TC.1972.5009071","article-title":"Some computer organizations and their effectiveness","author":"Flynn","year":"1972","journal-title":"IEEE Trans. Comput. C-21"},{"key":"10.1016\/0167-739X(91)90005-I_BIB23","series-title":"Proc. ACM Symp. on LISP and Functional Programming","first-page":"28","article-title":"Integrating functional and imperative programming","author":"Gifford","year":"1986"},{"key":"10.1016\/0167-739X(91)90005-I_BIB24","series-title":"Distributed Computing","first-page":"1","article-title":"The dataflow approach","author":"Glauert","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB25","series-title":"Research Topics in Functional Programming","first-page":"309","article-title":"Higher order functions considered unnecessary for higher order programming","author":"Goguen","year":"1990"},{"issue":"6","key":"10.1016\/0167-739X(91)90005-I_BIB26","first-page":"91","article-title":"Data driven system for high speed parallel computing","volume":"19","author":"Gurd","year":"1981","journal-title":"Comput. Design"},{"key":"10.1016\/0167-739X(91)90005-I_BIB27","series-title":"Proc. Workshop on Graph Reduction","first-page":"181","article-title":"The design and implementation of ALICE: a parallel graph reduction machine","volume":"279","author":"Harrison","year":"1987"},{"key":"10.1016\/0167-739X(91)90005-I_BIB28","series-title":"Functional Programming: Application and Implementation","author":"Henderson","year":"1980"},{"key":"10.1016\/0167-739X(91)90005-I_BIB29","series-title":"Functional Programming and Its Applications","first-page":"177","article-title":"Purely functional operating systems","author":"Henderson","year":"1982"},{"key":"10.1016\/0167-739X(91)90005-I_BIB30","series-title":"The Connection Machine","author":"Hillis","year":"1985"},{"key":"10.1016\/0167-739X(91)90005-I_BIB31","series-title":"Introduction to Logic Programming","author":"Hogger","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB32","series-title":"Formal structures for computation and deduction","author":"Huet","year":"1986"},{"key":"10.1016\/0167-739X(91)90005-I_BIB33","series-title":"Proc. 5th Internat. Joint Conf. on Artificial Intelligence","first-page":"406","article-title":"Associative-commutative pattern matching","author":"Hullot","year":"1979"},{"key":"10.1016\/0167-739X(91)90005-I_BIB34","volume":"vol. II","author":"Ibbett","year":"1989"},{"key":"10.1016\/0167-739X(91)90005-I_BIB35","series-title":"Fifth Generation Computer Systems","author":"ICOT","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB36","series-title":"Proc. Conf. on Functional Languages and Computer Architecture","first-page":"194","article-title":"Functional programming with sets","volume":"274","author":"Jayaraman","year":"1987"},{"key":"10.1016\/0167-739X(91)90005-I_BIB37","series-title":"Proc. North American Conf. on Logic Programming","first-page":"1052","article-title":"Programming with equations, subsets, and relations","author":"Jayaraman","year":"1989"},{"key":"10.1016\/0167-739X(91)90005-I_BIB38","series-title":"Proc. ACM Conf. on Compiler Construction","first-page":"58","article-title":"Efficient compilation of lazy evaluation","author":"Johnson","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB39","series-title":"Proc. IEEE Spring Compcon","first-page":"410","article-title":"Rediflow multiprocessing","author":"Keller","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB40","series-title":"Distributed Computing","first-page":"111","article-title":"The language first approach","author":"Kennaway","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB41","series-title":"Distributed Computing","first-page":"125","article-title":"Towards a successor to von Neumann","author":"Kennaway","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB42","series-title":"Technical report","article-title":"Marigold - A functional, flow-graph language","author":"Kieburtz","year":"1985"},{"key":"10.1016\/0167-739X(91)90005-I_BIB43","series-title":"Proc. Conf. on Functional Languages and Computer Architecture","first-page":"400","article-title":"The G-machine: a fast graph-reduction evaluator","volume":"201","author":"Kieburtz","year":"1985"},{"key":"10.1016\/0167-739X(91)90005-I_BIB44","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0167-739X(91)90005-I_BIB45","series-title":"Proc. ACM Symp. on LISP and Functional Programming","first-page":"105","article-title":"An architecture for mostly functional languages","author":"Knight","year":"1986"},{"key":"10.1016\/0167-739X(91)90005-I_BIB46","series-title":"Logic for Problem Solving","author":"Kowalski","year":"1979"},{"key":"10.1016\/0167-739X(91)90005-I_BIB47","series-title":"Proc. 5th Internat. Conf. and Symp. on Logic Programming","first-page":"1506","article-title":"Instruction architecture for a high performance integrated Prolog processor IPP","author":"Kurosawa","year":"1988"},{"issue":"4","key":"10.1016\/0167-739X(91)90005-I_BIB48","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","article-title":"The mechanical evaluation of expressions","volume":"6","author":"Landin","year":"1963","journal-title":"Comput. J."},{"key":"10.1016\/0167-739X(91)90005-I_BIB49","series-title":"Proc. 2nd Internat. Conf. on Supercomputing","first-page":"63","article-title":"Architectural options for the Rewrite Rule Machine","author":"Leiwand","year":"1987"},{"key":"10.1016\/0167-739X(91)90005-I_BIB50","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0167-739X(91)90005-I_BIB51","series-title":"High-Level Language Computer Architecture","first-page":"430","article-title":"The FFP machine","author":"Mago","year":"1989"},{"key":"10.1016\/0167-739X(91)90005-I_BIB52","series-title":"Computer Programming and Formal Systems","first-page":"33","article-title":"A basis for a mathematical theory of programming","author":"McCarthy","year":"1963"},{"key":"10.1016\/0167-739X(91)90005-I_BIB53","series-title":"Proc. Symp. on Logical Foundations of Computer Science","first-page":"208","article-title":"A mathematical modelling of pure, recursive algorithms","volume":"363","author":"Moschovakis","year":"1989"},{"key":"10.1016\/0167-739X(91)90005-I_BIB54","series-title":"Classical Recursion Theory","author":"Odifreddi","year":"1989"},{"key":"10.1016\/0167-739X(91)90005-I_BIB55","article-title":"Computing in systems described by equations","volume":"58","author":"O'Donnell","year":"1977"},{"key":"10.1016\/0167-739X(91)90005-I_BIB56","series-title":"Equational Logic as a Programming Language","author":"O'Donnell","year":"1985"},{"key":"10.1016\/0167-739X(91)90005-I_BIB57","series-title":"Proc. Conf. on Term Rewriting and Applications","first-page":"1","article-title":"Term-rewriting implementation of equational logic programming","volume":"256","author":"O'Donnell","year":"1987"},{"key":"10.1016\/0167-739X(91)90005-I_BIB58","series-title":"Internal Report","article-title":"RRM: A reconfigurable rewrite machine","author":"Pawagi","year":"1989"},{"key":"10.1016\/0167-739X(91)90005-I_BIB59","series-title":"Proc. Conf. Functional Languages and Computer Architecture","first-page":"98","article-title":"GRIP - A high performance architecture for parallel graph reduction","volume":"274","author":"Peyton-Jones","year":"1987"},{"key":"10.1016\/0167-739X(91)90005-I_BIB60","series-title":"Internal report","article-title":"Nondeterminism by associative-commutative rewriting","author":"Plaisted","year":"1986"},{"key":"10.1016\/0167-739X(91)90005-I_BIB61","series-title":"Proc. Conf. on Functional Languages and Computer Architecture","first-page":"1","article-title":"Control of parallelism in the Manchester dataflow machine","volume":"274","author":"Ruggiero","year":"1987"},{"key":"10.1016\/0167-739X(91)90005-I_BIB62","series-title":"Proc. ACM Conf. on LISP and Functional Programming","first-page":"212","article-title":"NORMA: A graph reduction processor","author":"Scheevel","year":"1986"},{"key":"10.1016\/0167-739X(91)90005-I_BIB63","series-title":"Logic Colloquium '86","first-page":"277","article-title":"Introduction to the theory of logic programming","author":"Shepherdson","year":"1988"},{"key":"10.1016\/0167-739X(91)90005-I_BIB64","series-title":"The Art of Prolog","author":"Sterling","year":"1968"},{"key":"10.1016\/0167-739X(91)90005-I_BIB65","article-title":"Connection machine model CM-2 technical summary","author":"Thinking Machines Corporation","year":"1987","journal-title":"Technical report HA87-4"},{"key":"10.1016\/0167-739X(91)90005-I_BIB66","series-title":"Large Scale Computer Architecture","author":"Thurber","year":"1967"},{"key":"10.1016\/0167-739X(91)90005-I_BIB67","series-title":"Functional Programming and Its Applications","first-page":"1","article-title":"Recursion equations as a programming language","author":"Turner","year":"1982"},{"issue":"12","key":"10.1016\/0167-739X(91)90005-I_BIB68","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1109\/TC.1984.1676387","article-title":"A survey of proposed architectures for the execution of functional languages","author":"Vegdahl","year":"1984","journal-title":"IEEE Trans. Comput. C-33"},{"key":"10.1016\/0167-739X(91)90005-I_BIB69","series-title":"Technical Note No. 309","article-title":"An abstract Prolog instruction set","author":"Warren","year":"1983"},{"key":"10.1016\/0167-739X(91)90005-I_BIB70","series-title":"Fifth Generation Computer Architectures","first-page":"203","article-title":"Parallel data-driven graph reduction","author":"Watson","year":"1986"},{"key":"10.1016\/0167-739X(91)90005-I_BIB71","series-title":"Internal Report","article-title":"FLAGSHIP models and machines","author":"Watson","year":"1986"},{"key":"10.1016\/0167-739X(91)90005-I_BIB72","series-title":"Proc. 15th Annual Internat. Symp. on Computer Architecture","first-page":"124","article-title":"FLAGSHIP: A parallel architecture for declarative programming","author":"Watson","year":"1988"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9190005I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9190005I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T07:29:13Z","timestamp":1551079753000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167739X9190005I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":72,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["0167739X9190005I"],"URL":"https:\/\/doi.org\/10.1016\/0167-739x(91)90005-i","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}