{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:37Z","timestamp":1761610297804,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)01135-7","type":"journal-article","created":{"date-parts":[[2005,4,8]],"date-time":"2005-04-08T09:19:45Z","timestamp":1112951985000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Writing Constructive Proofs Yielding Efficient Extracted Programs"],"prefix":"10.1016","volume":"37","author":[{"given":"Aleksey","family":"Nogin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)01135-7_bib1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/2363.2528","article-title":"Proofs as programs","volume":"7","author":"Bates","year":"1985","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)01135-7_bib2","doi-asserted-by":"crossref","unstructured":"Benzinger, R., Automated complexity analysis of Nuprl extracted programs (2000), to appear in Journal of Functional Programming.","DOI":"10.1017\/S0956796800003865"},{"key":"10.1016\/S1571-0661(05)01135-7_bib3","unstructured":"Constable, R. L., S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki and S. F. Smith, \u201cImplementing Mathematics with the Nuprl Development System,\u201d Prentice-Hall, NJ, 1986."},{"key":"10.1016\/S1571-0661(05)01135-7_bib4","unstructured":"Constable, R. L., P. Jackson, P. Naumov and J. Uribe, Constructively formalizing automata theory, Proof, Language and Interaction: Essays in Honour of Robert Milner (1998)."},{"key":"10.1016\/S1571-0661(05)01135-7_bib5","first-page":"285","article-title":"Writing programs that construct proofs","volume":"1","author":"Constable","year":"1984","journal-title":"J. Automated Reasoning"},{"year":"1969","series-title":"\u201cFormal Languages and Their Relation to Automata,\u201d","author":"Hopcroft","key":"10.1016\/S1571-0661(05)01135-7_bib6"},{"year":"1990","series-title":"\u201cProgramming in Martin-L\u00f6f's Type Theory,\u201d","author":"Nordstrom","key":"10.1016\/S1571-0661(05)01135-7_bib7"},{"key":"10.1016\/S1571-0661(05)01135-7_bib8","unstructured":"Paulin, C. and B. Werner, Extracting and executing programs developed in the inductive construction systems, in: Proceedings of First Annual Workshop of Logical Frameworks, Sophia-Antipolis, France, 1990, pp. 349\u2013361."},{"key":"10.1016\/S1571-0661(05)01135-7_bib9","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0747-7171(06)80007-6","article-title":"Synthesis of ML programs in the system Coq","volume":"15","author":"Paulin-Mohring","year":"1993","journal-title":"Journal of Symbolic Computations"},{"key":"10.1016\/S1571-0661(05)01135-7_bib10","unstructured":"Sasaki, J. T., \u201cThe Extraction and Optimization of Programs from Constructive Proofs,\u201d Ph.D. thesis, Cornell University (1985)."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011357?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011357?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:40Z","timestamp":1761610000000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105011357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":10,"alternative-id":["S1571066105011357"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)01135-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Writing Constructive Proofs Yielding Efficient Extracted Programs","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)01135-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}