{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:30Z","timestamp":1761611070564},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0304-3975(94)00021-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"319-343","source":"Crossref","is-referenced-by-count":13,"title":["Automatizing termination proofs of recursively defined functions"],"prefix":"10.1016","volume":"135","author":[{"given":"Pascal","family":"Manoury","sequence":"first","affiliation":[]},{"given":"Marianne","family":"Simonot","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00021-2_BIB1","first-page":"146","article-title":"Programming with proofs","volume":"26","author":"Krivine","year":"1990","journal-title":"J. Inform. Process. Cybern. EIK"},{"key":"10.1016\/0304-3975(94)00021-2_BIB2","first-page":"460","article-title":"Reasoning about functionnal programs and complexity classes associated with type discipline","author":"Leivant","year":"1983","journal-title":"Proc. 24th FOCS"},{"key":"10.1016\/0304-3975(94)00021-2_BIB3","series-title":"Proc. LPAR 92","article-title":"ProPre: a programming language with proofs","volume":"Vol. 624","author":"Manoury","year":"1992"},{"key":"10.1016\/0304-3975(94)00021-2_BIB4","unstructured":"P. Manoury and M. Simonot Des preuves de totalit\u00e9 de fonctions comme synth\u00e8se de programmes, Ph.d. Thesis, Univ. Paris VII."},{"key":"10.1016\/0304-3975(94)00021-2_BIB5","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(92)90042-E","article-title":"Recursive programming with proofs","volume":"94","author":"Parigot","year":"1992","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000212?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000212?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:04Z","timestamp":1555127524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594000212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0304397594000212"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00021-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}