{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:16:20Z","timestamp":1648944980440},"reference-count":44,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0141-9331(96)01123-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:50:06Z","timestamp":1027637406000},"page":"511-520","source":"Crossref","is-referenced-by-count":0,"title":["Experience using an intermediate compiler target language for parallel machines"],"prefix":"10.1016","volume":"20","author":[{"given":"George A.","family":"Papadopoulos","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0141-9331(96)01123-4_BIB1","doi-asserted-by":"crossref","unstructured":"S. Ahuja, N. Carriero, D. Gelernter, Linda and friends, IEEE Comput. 19 (1986) 26\u201334.","DOI":"10.1109\/MC.1986.1663305"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB2","unstructured":"R. Banach, MONSTR: Term graph rewriting for parallel machines, in: M.R. Sleep, M.J. Plasmeijer, M.C.J.D. Eekelen (Eds.), Term Graph Rewriting: Theory and Practice, John Wiley, New York, 1993, pp. 243\u2013252."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB3","unstructured":"R. Banach, J. Balazs, G.A. Papadopoulos, Translating the pi-calculus into MONSTR, J. Universal Comput. Sci. 6 (1995) 335\u2013394."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB4","unstructured":"R. Banach, G.A. Papadopoulos, Parallel term graph rewriting and concurrent logic programs, Proc. Parallel and Distributed Processing '93, Sofia, Bulgaria, May 4\u20137, 1993, North Holland, pp. 303\u2013322."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB5","doi-asserted-by":"crossref","unstructured":"R. Banach, G.A. Papadopoulos, Linear behaviour of term graph rewriting programs, Proc. ACM Symp. on Applied Computing '95, Nashville, TN, USA, Feb. 26\u201328, 1995, ACM Computer Society Press, pp. 157\u2013163.","DOI":"10.1145\/315891.315946"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB6","doi-asserted-by":"crossref","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep, Term graph rewriting, Proc. PARLE '87, Eindhoven, The Netherlands, June 15\u201319, LNCS 259, Springer, 1987, pp. 141\u2013158.","DOI":"10.1007\/3-540-17945-3_8"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB7","doi-asserted-by":"crossref","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep, Lean: An intermediate language based on graph rewriting, Parallel Comput. 9 (1989) 163\u2013177.","DOI":"10.1016\/0167-8191(89)90126-9"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB8","doi-asserted-by":"crossref","unstructured":"R. Bisiani, A. Forin, Multilanguage parallel programming of heterogeneous machines, IEEE Trans. Comput. C-37 (1988) 930\u2013944.","DOI":"10.1109\/12.2245"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB9","unstructured":"F. Bueno, M. Hermenegildo, An automatic translation scheme from Prolog to the Andorra Kernel Language, Proc. FGCS '92, June 1\u20135, Tokyo, Japan, ICOT Publ., 1992, pp. 759\u2013769."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB10","doi-asserted-by":"crossref","unstructured":"K.M. Chandy, C. Kesselman, Parallel programming in 2001, IEEE Software (Nov. 1991) 11\u201320.","DOI":"10.1109\/52.103573"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB11","unstructured":"F.C. Chow, M. Ganapathi, Intermediate languages in compiler construction: A bibliography, SIGPLAN Notices 18 (1983) 21\u201323."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB12","doi-asserted-by":"crossref","unstructured":"J. Darlington, M. Reeve, Alice: A multiprocessor reduction machine for the parallel evaluation of applicative languages, Proc. ACM FPLCA '81, New Hampshire, 1981, pp. 65\u201375.","DOI":"10.1145\/800223.806764"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB13","unstructured":"ESPRIT II EP 2025, European Declarative Systems, Vols. 1\u20136, 1989."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB14","doi-asserted-by":"crossref","unstructured":"I. Foster, R. Olson, S. Tuecke, Productive parallel programming: The PCN approach, Sci. Progr. 1 (1992) 51\u201366.","DOI":"10.1155\/1992\/519840"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB15","unstructured":"I. Foster, S. Taylor, Strand: New Concepts in Parallel Programming, Prentice Hall, New York, 1990."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB16","doi-asserted-by":"crossref","unstructured":"J.R.W. Glauert, Asynchronous mobile processes and graph rewriting, Proc. PARLE '92, Champs Sur Marne, Paris, June 15\u201318, LNCS 605, Springer, 1992, pp. 63\u201378.","DOI":"10.1007\/3-540-55599-4_81"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB17","unstructured":"J.R.W. Glauert, K. Hammond, J.R. Kennaway, G.A. Papadopoulos, Using Dactl to implement declarative languages, Proc. CONPAR '88, Manchester, UK, Sept. 12\u201316, Cambridge University Press, 1988, pp. 116\u2013124."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB18","unstructured":"J.R.W. Glauert, J.R. Kennaway, M.R. Sleep, Final specification of Dactl, Internal Report SYS-C88-11, School of Information Systems, University of East Anglia, Norwich, UK, 1988."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB19","doi-asserted-by":"crossref","unstructured":"J.R.W. Glauert, J.R. Kennaway, M.R. Sleep, Dactl: An experimental graph rewriting language, Proc. Graph Grammars and Their Applications to Computer Science, LNCS 532, Springer, 1990, pp. 378\u2013395.","DOI":"10.1007\/BFb0017401"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB20","unstructured":"J.R.W. Glauert, G.A. Papadopoulos, A parallel implementation of GHC, Proc. FGCS '88, Tokyo, Japan, Nov. 28\u2013Dec. 2, 1988, Vol. 3, pp. 1051\u20131058."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB21","unstructured":"J.R.W. Glauert, G.A. Papadopoulos, Unifying concurrent logic and functional languages in a graph rewriting framework, Proc. 3rd Panhellenic Computer Science Conference, Athens, Greece, May 26\u201331, 1991, Vol. 1, pp. 59\u201368."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB22","doi-asserted-by":"crossref","unstructured":"J.A. Goguen, C. Kirchner, J. Meseguer, Concurrent term rewriting as a model of computation, Proc. Graph Reduction Workshop, Santa Fe, Mexico, USA, Sept. 29\u2013Oct. 1, LNCS 279, Springer, 1986, pp. 53\u201393.","DOI":"10.1007\/3-540-18420-1_50"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB23","unstructured":"S. Gregory, Parallel Logic Programming in Parlog: The Language and its Implementation, Addison-Wesley, London, 1987."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB24","unstructured":"K. Hammond, Parallel SML: A functional language and its implementation in Dactl, Ph.D. Thesis, School of Information Systems, University of East Anglia, Norwich, UK, published by Pitman Publishers, London, UK, 1990."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB25","unstructured":"S. Janson, S. Haridi, Programming paradigms of the Andorra Kernel Language, Proc. ISLP '91, San Diego, USA, Oct. 28\u2013Nov. 1, MIT Press, 1991, pp. 167\u2013186."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB26","unstructured":"J.F.Th. Kamperman, GEL, a graph exchange language, Technical Report, CWI, Amsterdam, The Netherlands, 1994."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB27","doi-asserted-by":"crossref","unstructured":"J.A. Keane, An overview of the Flagship system, J. Funct. Progr. 4 (1994) 19\u201345.","DOI":"10.1017\/S0956796800000927"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB28","doi-asserted-by":"crossref","unstructured":"J.R. Kennaway, Implementing term rewrite languages in Dactl, Theor. Comput. Sci. 72 (1990) 225\u2013250.","DOI":"10.1016\/0304-3975(90)90036-H"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB29","doi-asserted-by":"crossref","unstructured":"P. Kornerup, B.B. Kristensen, A.O.L. Madsen, Interpretation and code generation based on intermediate languages, Software Pract. Exper. 10 (1980) 635\u2013658.","DOI":"10.1002\/spe.4380100804"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB30","unstructured":"J. Levy, E.Y. Shapiro, Translation of safe GHC and safe concurrent Prolog to FCP, in: E.Y. Shapiro (Ed.), Concurrent Prolog: Collected Papers, Vol. 2, MIT Press, 1987, Chapter 33."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB31","unstructured":"J. Levy, E.Y. Shapiro, CFL: A concurrent functional language embedded in a concurrent logic programming environment, in: E.Y. Shapiro (Ed.), Concurrent Prolog: Collected Papers, Vol. 2, MIT Press, 1987, Chapter 35."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB32","doi-asserted-by":"crossref","unstructured":"K.J. Ottenstein, Intermediate program representations in compiler construction: A supplemental bibliography, SIGPLAN Notices 19 (1987) 25\u201327.","DOI":"10.1145\/988574.988579"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB33","doi-asserted-by":"crossref","unstructured":"G.A. Papadopoulos, A fine grain parallel implementation of Parlog, Proc. TAPSOFT '89, Barcelona, Spain, March 13\u201317, LNCS 352, Springer, 1989, pp. 313\u2013327.","DOI":"10.1007\/3-540-50940-2_44"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB34","unstructured":"G.A. Papadopoulos, Object-oriented term graph rewriting, International Journal of Computer systems Science and Engineering, CRL Publs, 1997 (accepted for publication)."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB35","doi-asserted-by":"crossref","unstructured":"S.L. Peyton Jones, C. Clack, J. Salkild, M. Hardie, GRIP: A high performance architecture for parallel graph reduction, Proc. FPLCA '87, Portland, Oregon, USA, Sept. 14\u201316, LNCS 274, Springer, 1987, pp. 98\u2013112.","DOI":"10.1007\/3-540-18317-5_7"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB36","unstructured":"M.J. Plasmeijer, M.C.J.D. Eekelen, Functional Programming and Parallel Graph Rewriting, Addison-Wesley, New York, 1993."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB37","doi-asserted-by":"crossref","unstructured":"P. Quintas, Software engineering policy and practice: Lessons from the Alvey program, J. Syst. Software 24 (1994) 67\u201388.","DOI":"10.1016\/0164-1212(94)90106-6"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB38","doi-asserted-by":"crossref","unstructured":"E.Y. Shapiro, The family of concurrent logic programming languages, Comput. Surv. 21 (1989) 412\u2013510.","DOI":"10.1145\/72551.72555"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB39","unstructured":"M.R. Sleep, M.J. Plasmeijer, M.C.J.D. Eekelen (eds.), Term Graph Rewriting: Theory and Practice, John Wiley, New York, 1993."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB40","doi-asserted-by":"crossref","unstructured":"T.B. Steel, UNCOL: The myth and the fact, Annu. Rev. Automated Progr. 2 (1961) 325\u2013344.","DOI":"10.1016\/S0066-4138(61)80014-1"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB41","unstructured":"J. Thornley, A collection of declarative Ada example programs, Technical Report CS-TR-93-05, Computer Science Department, California Institute of Technology, CA, USA, 1993."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB42","unstructured":"D.H.D. Warren, An abstract Prolog instruction set, Technical Note 309, SRI International, Menlo Park, CA, USA, Oct. 1983."},{"key":"10.1016\/S0141-9331(96)01123-4_BIB43","doi-asserted-by":"crossref","unstructured":"I. Watson, V. Woods, P. Watson, R. Banach, M. Greenberg, J. Sargeant, Flagship: A parallel architecture for declarative programming, Proc. 15th Annual ISCA, Hawaii, May 30\u2013June 2, 1988, pp. 124\u2013130.","DOI":"10.1109\/ISCA.1988.5221"},{"key":"10.1016\/S0141-9331(96)01123-4_BIB44","doi-asserted-by":"crossref","unstructured":"K. Ueda, Guarded horn clauses, D.Eng. Thesis, University of Tokyo, Japan, 1986.","DOI":"10.1007\/3-540-16479-0_17"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933196011234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933196011234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T23:50:28Z","timestamp":1580255428000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0141933196011234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":44,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0141933196011234"],"URL":"https:\/\/doi.org\/10.1016\/s0141-9331(96)01123-4","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}