{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:09:11Z","timestamp":1648973351237},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":[[1992,2]]},"DOI":"10.1016\/0950-5849(92)90109-3","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"91-96","source":"Crossref","is-referenced-by-count":2,"title":["Forced transformation of Occam programs"],"prefix":"10.1016","volume":"34","author":[{"given":"F","family":"Nielson","sequence":"first","affiliation":[]},{"given":"HR","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0950-5849(92)90109-3_BIB1","first-page":"177","article-title":"The laws of Occam programming","volume":"Vol 60","author":"Roscoe","year":"1988","journal-title":"Trans. Comput. Syst."},{"key":"10.1016\/0950-5849(92)90109-3_BIB2","series-title":"The Oxford Occam transformation system","author":"Goldsmith","year":"1988"},{"key":"10.1016\/0950-5849(92)90109-3_BIB3","series-title":"Proc. ESOP'90","first-page":"291","article-title":"Eureka definitions for free! or disagreement points for fold\/unfold transformations","volume":"Vol 432","author":"Nielson","year":"1990"},{"key":"10.1016\/0950-5849(92)90109-3_BIB4","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"Vol 24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0950-5849(92)90109-3_BIB5","author":"Inmos Ltd","year":"1988"},{"key":"10.1016\/0950-5849(92)90109-3_BIB6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00289507","article-title":"Proof of correctness of data representations","volume":"Vol 1","author":"Hoare","year":"1972","journal-title":"Acta Inf."},{"key":"10.1016\/0950-5849(92)90109-3_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6423(88)90025-1","article-title":"Automatic binding time analysis for a typed \u03bb-calculus","volume":"Vol 10","author":"Nielson","year":"1988","journal-title":"Sci. Comput. Prog."}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0950584992901093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0950584992901093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:26:31Z","timestamp":1552609591000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0950584992901093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["0950584992901093"],"URL":"https:\/\/doi.org\/10.1016\/0950-5849(92)90109-3","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}