{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:00:17Z","timestamp":1780725617480,"version":"3.54.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":4125,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0168-0072(01)00073-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:20:24Z","timestamp":1027606824000},"page":"3-25","source":"Crossref","is-referenced-by-count":39,"title":["Refined program extraction from classical proofs"],"prefix":"10.1016","volume":"114","author":[{"given":"Ulrich","family":"Berger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wilfried","family":"Buchholz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Helmut","family":"Schwichtenberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(01)00073-2_BIB1","series-title":"Typed Lambda Calculi and Applications","first-page":"45","article-title":"Extracting constructive content from classical logic via control-like reductions","volume":"vol. 664","author":"Barbanera","year":"1993"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB2","doi-asserted-by":"crossref","unstructured":"U. Berger, Programs from classical proofs, in: M. Behara, R. Fritsch, R.G. Lintz (Eds.), Symposia Gaussiana, Proc. 2nd Gauss Symp., Conf. A: Mathematics and Theoretical Physics. Munich, Germany, August 2\u20137, 1993, Walter de Gruyter, Berlin, 1995, pp. 187\u2013200.","DOI":"10.1515\/9783110886726.187"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB3","doi-asserted-by":"crossref","unstructured":"U. Berger, H. Schwichtenberg, Program extraction from classical proofs, in: D. Leivant (Ed.), Logic and Computational Complexity, International Workshop LCC\u201994, Indianapolis, IN, USA, October 1994, Lecture Notes in Computer Science, vol. 960, Springer, Berlin, 1995, pp. 77\u201397.","DOI":"10.1007\/3-540-60178-3_80"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1026748613865","article-title":"The Warshall algorithm and Dickson's lemma","volume":"26","author":"Berger","year":"2001","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0168-0072(01)00073-2_BIB5","series-title":"Logical Frameworks","first-page":"341","article-title":"Finding computational content in classical proofs","author":"Constable","year":"1991"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB6","series-title":"Types for Proofs and Programs","article-title":"Gr\u00f6bner basis in type theory.","volume":"vol. 1657","author":"Coquand","year":"1999"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB7","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","article-title":"Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors","volume":"35","author":"Dickson","year":"1913","journal-title":"Am. J. Math."},{"key":"10.1016\/S0168-0072(01)00073-2_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","article-title":"A syntactic theory of sequential control","volume":"52","author":"Felleisen","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0168-0072(01)00073-2_BIB9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","article-title":"The revised report on the syntactic theory of sequential control and state","volume":"102","author":"Felleisen","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0168-0072(01)00073-2_BIB10","series-title":"Higher Set Theory","first-page":"21","article-title":"Classically and intuitionistically provably recursive functions","volume":"vol. 669","author":"Friedman","year":"1978"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB11","doi-asserted-by":"crossref","unstructured":"T.G. Griffin, A formulae-as-types notion of control, in: Conf. Record 17th Annu. ACM Symp. on Principles of Programming Languages, 1990, pp. 47\u201358.","DOI":"10.1145\/96709.96714"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB12","series-title":"Logic: from Foundations to Applications. European Logic Colloquium (Keele, 1993)","first-page":"225","article-title":"Analysing proofs in analysis","author":"Kohlenbach","year":"1996"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0168-0072(94)90047-7","article-title":"Classical logic, storage operators and second-order lambda-calculus","volume":"68","author":"Krivine","year":"1994","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"10.1016\/S0168-0072(01)00073-2_BIB14","doi-asserted-by":"crossref","first-page":"682","DOI":"10.2307\/2274322","article-title":"Syntactic translations and provably recursive functions","volume":"50","author":"Leivant","year":"1985","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB15","unstructured":"C. Murthy, Extracting constructive content from classical proofs, Technical Report 90-1151, Ph.D. Thesis, Department of Computer Science, Cornell University, Ithaca, New York, 1990."},{"key":"10.1016\/S0168-0072(01)00073-2_BIB16","doi-asserted-by":"crossref","unstructured":"M. Parigot, \u03bb\u03bc-calculus: an algorithmic interpretation of classical natural deduction, in: Proc. Log. Prog. Automatic Reasoning, St. Petersburg, Lecture Notes in Computer Science, vol. 624 Springer, Berlin, 1992, pp. 190\u2013201.","DOI":"10.1007\/BFb0013061"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB17","volume":"vol. 344","year":"1973"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB18","series-title":"Constructivism in Mathematics, An Introduction","volume":"vols. 121 and 123","author":"Troelstra","year":"1988"},{"key":"10.1016\/S0168-0072(01)00073-2_BIB19","first-page":"193","article-title":"Ramsey's theorem and the pigeonhole principle in intuitionistic mathematics","volume":"47","author":"Bezem","year":"1993","journal-title":"J. London Math. Soc."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007201000732?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007201000732?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:30:12Z","timestamp":1556451012000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007201000732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0168007201000732"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(01)00073-2","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}