{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:26:43Z","timestamp":1648690003350},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1988,9]]},"DOI":"10.1007\/bf03037135","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T02:58:38Z","timestamp":1240369118000},"page":"143-157","source":"Crossref","is-referenced-by-count":7,"title":["Unfolding rules for GHC programs"],"prefix":"10.1007","volume":"6","author":[{"given":"Koichi","family":"Furukawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Okumura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaki","family":"Murakami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037135_CR1","doi-asserted-by":"crossref","unstructured":"Brock, J. D. and Ackerman, W. B., \u201cScenario: A Model of Nondeterminate Computation,\u201d inFormalization of Programming Concepts (J. Diaz and I. Ramos, ed.),Lecture Notes in Computer Science, Vol. 107, Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10699-5_102"},{"key":"BF03037135_CR2","doi-asserted-by":"crossref","unstructured":"Clark, K. L. and Gregory, S., \u201cPARLOG: Parallel Programming in Logic,\u201dACM Trans. Program. Lang. Syst. 8,1.","DOI":"10.1145\/5001.5390"},{"key":"BF03037135_CR3","unstructured":"Furukawa, K. and Ueda, K., \u201cGHC Process Fusion by Program Transformation,\u201dProc. the Second Annual Conference of Japan Society of Softwate Science and Technology, 1985."},{"key":"BF03037135_CR4","unstructured":"Shapiro, E. Y., \u201cA Subset of Concurrent Prolog and Its Interpreter,\u201dICOT Tech. Report, TR-003."},{"key":"BF03037135_CR5","doi-asserted-by":"crossref","unstructured":"Shapiro, E. Y., \u201cConcurrent Prolog: A Progress Report,\u201dIEEE Computer, Vol.19,No. 8, 1986.","DOI":"10.1109\/MC.1986.1663307"},{"key":"BF03037135_CR6","doi-asserted-by":"crossref","unstructured":"Ueda, K., \u201cGuarded Horn Clauses,\u201dProc. Logic Programming \u201985 (Lecture Notes in Computer Science, Vol. 221), Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16479-0_17"},{"key":"BF03037135_CR7","unstructured":"Ueda, K., et al., \u201cTransformation Rules for FGHC Programs,\u201d forthcoming, 1988."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037135.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037135\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:30Z","timestamp":1558572750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["BF03037135"],"URL":"https:\/\/doi.org\/10.1007\/bf03037135","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}