{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:27:24Z","timestamp":1648776444458},"reference-count":24,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":["Information and Software Technology"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0950-5849(96)01093-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:22:28Z","timestamp":1027621348000},"page":"539-547","source":"Crossref","is-referenced-by-count":1,"title":["Concurrent object-oriented programming using term graph rewriting techniques"],"prefix":"10.1016","volume":"38","author":[{"given":"George A.","family":"Papadopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0950-5849(96)01093-2_BIB1","series-title":"Proc. PARLE'87","first-page":"141","article-title":"Term graph rewriting","author":"Barendregt","year":"1987"},{"key":"10.1016\/0950-5849(96)01093-2_BIB2","series-title":"Term Graph Rewriting: Theory and Practice","year":"1993"},{"key":"10.1016\/0950-5849(96)01093-2_BIB3","article-title":"Parallel SML: A Functional Language and its Implementation in Dactl","author":"Hammond","year":"1990"},{"key":"10.1016\/0950-5849(96)01093-2_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(90)90036-H","article-title":"Implementing term rewrite languages in Dactl","volume":"72","author":"Kennaway","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0950-5849(96)01093-2_BIB5","series-title":"Proc. Parallel and Distributed Processing '93","first-page":"303","article-title":"Parallel term graph rewriting and concurrent logic programs","author":"Banach","year":"1993"},{"key":"10.1016\/0950-5849(96)01093-2_BIB6","series-title":"Proc. FGCS'88","first-page":"1051","article-title":"A parallel implementation of GHC","author":"Glauert","year":"1988"},{"key":"10.1016\/0950-5849(96)01093-2_BIB7","series-title":"Proc. TAPSOFT'89","first-page":"313","article-title":"A fine grain parallel implementation of parlog","author":"Papadopoulos","year":"1989"},{"key":"10.1016\/0950-5849(96)01093-2_BIB8","series-title":"Proc. IEEE 1st ICA3PP","first-page":"61","article-title":"A highly parallel model for object-oriented concurrent constraint programming","author":"Banach","year":"1995"},{"key":"10.1016\/0950-5849(96)01093-2_BIB9","series-title":"Proc. ACM SAC'95","first-page":"157","article-title":"Linear behaviour of term graph rewriting programs","author":"Banach","year":"1995"},{"key":"10.1016\/0950-5849(96)01093-2_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear Logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0950-5849(96)01093-2_BIB11","first-page":"335","article-title":"Translating the picalculus into MONSTR","volume":"1","author":"Banach","year":"1995","journal-title":"Journal of Universal Computer Science"},{"key":"10.1016\/0950-5849(96)01093-2_BIB12","series-title":"Proc. PARLE'92","first-page":"63","article-title":"Asynchronous mobile processes and graph rewriting","author":"Glauert","year":"1992"},{"key":"10.1016\/0950-5849(96)01093-2_BIB13","series-title":"Proc. ECOOP'93","first-page":"220","article-title":"Solving the inheritance anomaly in concurrent object-oriented programming","author":"Meseguer","year":"1993"},{"key":"10.1016\/0950-5849(96)01093-2_BIB14","series-title":"Proc. CONPAR'88","first-page":"116","article-title":"Using Dactl to implement declarative languages","author":"Glauert","year":"1988"},{"key":"10.1016\/0950-5849(96)01093-2_BIB15","series-title":"Proc. GRA GRA","first-page":"378","article-title":"Dactl: an experimental graph rewriting language","author":"Glauert","year":"1990"},{"key":"10.1016\/0950-5849(96)01093-2_BIB16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1017\/S0956796800000927","article-title":"An overview of the flagship system","volume":"4","author":"Keane","year":"1994","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/0950-5849(96)01093-2_BIB17","series-title":"Research Directions in Object-Based Concurrency","year":"1993"},{"key":"10.1016\/0950-5849(96)01093-2_BIB18","series-title":"Object-Oriented Concurrent Programming","year":"1987"},{"key":"10.1016\/0950-5849(96)01093-2_BIB19","series-title":"Proc. 1st JSST","first-page":"1","article-title":"Uniting functional and object-oriented programming","author":"Sargeant","year":"1993"},{"key":"10.1016\/0950-5849(96)01093-2_BIB20","first-page":"951","article-title":"Logic programs with inheritance","volume":"2","author":"Goldberg","year":"1992"},{"key":"10.1016\/0950-5849(96)01093-2_BIB21","series-title":"Proc. ICLP'94","first-page":"240","article-title":"Concurrency and plan generation in a logic programming language with a sequential operator","author":"Guglielmi","year":"1994"},{"key":"10.1016\/0950-5849(96)01093-2_BIB22","series-title":"Proc. 8th OOPSLA'93","first-page":"109","article-title":"Highly efficient and encapsulated re-use of synchronization code in concurrent object-oriented languages","author":"Matsuoka","year":"1993"},{"key":"10.1016\/0950-5849(96)01093-2_BIB23","author":"Kamperman","year":"1994"},{"key":"10.1016\/0950-5849(96)01093-2_BIB24","series-title":"Proc. ICLP'90","first-page":"495","article-title":"Linear objects: logical processes with built-in inheritance","author":"Andreoli","year":"1990"}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0950584996010932?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0950584996010932?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:20:13Z","timestamp":1556058013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0950584996010932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":24,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0950584996010932"],"URL":"https:\/\/doi.org\/10.1016\/0950-5849(96)01093-2","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}