{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T06:43:41Z","timestamp":1649054621497},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4288,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0661(04)00300-7","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"412-424","source":"Crossref","is-referenced-by-count":1,"title":["System Presentation"],"prefix":"10.1016","volume":"59","author":[{"given":"J.-Y.","family":"Moyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00300-7_NEWBIB1","article-title":"Algorithms with polynomial interpretation termination proof","volume":"11","author":"Bonfante","year":"2000","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(04)00300-7_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Bonfante G., Marion J.-Y., and Moyen J.-Y. On lexicographic termination ordering with space bound certifications. In PSI (Jul 2001), Lecture Notes in Computer Science, Springer.","DOI":"10.1007\/3-540-45575-2_46"},{"key":"10.1016\/S1571-0661(04)00300-7_NEWBIB3","first-page":"243","volume":"vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S1571-0661(04)00300-7_NEWBIB4","first-page":"55","article-title":"The expressive power of higher order types or, life without cons","volume":"1","author":"Jones","year":"2000","journal-title":"Journal of Functional Programming 11"},{"key":"10.1016\/S1571-0661(04)00300-7_NEWBIB5","article-title":"Analysing the implicit complexity of programs","author":"Marion","year":"2000","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00300-7_NEWBIB6","unstructured":"Marion J.-Y. Complexit\u00e9 implicite des calculs, de la thorie la pratique, 2000. Habilitation."},{"key":"10.1016\/S1571-0661(04)00300-7_NEWBIB7","unstructured":"Marion J.-Y., and Moyen J.-Y. Efficient first order functional program interpreter with time bound certifications. In LPAR (Nov 2000), vol. 1955 of Lecture Notes in Computer Science, Springer, pp. 25\u201342."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104003007?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104003007?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T06:58:11Z","timestamp":1550213891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104003007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S1571066104003007"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00300-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}