{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:32Z","timestamp":1759626632291,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4184,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["09780266","10143105"],"award-info":[{"award-number":["09780266","10143105"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00352-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:11:15Z","timestamp":1027577475000},"page":"223-245","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Strong normalizability of the non-deterministic catch\/throw calculi"],"prefix":"10.1016","volume":"272","author":[{"given":"Yukiyoshi","family":"Kameyama","sequence":"first","affiliation":[]},{"given":"Masahiko","family":"Sato","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00352-2_BIB1","first-page":"45","article-title":"Extracting constructive content from classical logic via control-like reductions","volume":"vol. 664","author":"Barbanera","year":"1993"},{"issue":"6","key":"10.1016\/S0304-3975(00)00352-2_BIB2","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1017\/S0956796899003512","article-title":"A confluent \u03bb-calculus with a catch\/throw mechanism","volume":"9","author":"Crolard","year":"1999","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB3","first-page":"201","article-title":"A simple calculus of exception handling","volume":"vol. 902","author":"de Groote","year":"1995"},{"issue":"12","key":"10.1016\/S0304-3975(00)00352-2_BIB4","first-page":"1","article-title":"Calculus of Classical Proofs II","volume":"39","author":"Fujita","year":"1998","journal-title":"Trans. Inform. Process. Soc. Japan"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB5","unstructured":"K. Fujita, personal communication, 2000."},{"year":"1989","series-title":"Proofs and Types","author":"Girard","key":"10.1016\/S0304-3975(00)00352-2_BIB6"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB7","doi-asserted-by":"crossref","unstructured":"T. Griffin, A formulae-as-types notion of control, Proceedings of the 17th ACM Symposium on Principles of Programming Languages, 1990, pp. 47\u201358.","DOI":"10.1145\/96709.96714"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB8","series-title":"Second Fuji International Workshop on Functional and Logic Programming","first-page":"106","article-title":"A New Formulation of the Catch\/Throw Mechanism","author":"Kameyama","year":"1997"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB9","series-title":"Computing Theory, Proceedings of Fourth Australasian Theory Symposium, Australian Computer Science Communications, vol. 20, No. 3","first-page":"183","article-title":"A classical catch\/throw calculus with tag abstractions and its strong normalizability","author":"Kameyama","year":"1998"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB10","doi-asserted-by":"crossref","unstructured":"C. Murthy, An Evaluation Semantics for Classical Proofs, Conference Record IEEE Symposium on Logic in Computer Science, 1991, pp. 96\u2013107.","DOI":"10.1109\/LICS.1991.151634"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB11","doi-asserted-by":"crossref","unstructured":"H. Nakano, A constructive formalization of the catch and throw mechanism, Conference Record IEEE Symposium on Logic in Computer Science, 1992, pp. 82\u201389.","DOI":"10.1109\/LICS.1992.185522"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB12","first-page":"61","volume":"vol. 792","author":"Nakano","year":"1994"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0168-0072(94)90087-6","article-title":"A constructive logic behind the catch and throw mechanism","volume":"69","author":"Nakano","year":"1994","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(00)00352-2_BIB14","unstructured":"H. Nakano, Logical structures of the catch and throw mechanism, Ph. D Dissertation, University of Tokyo, 1995."},{"key":"10.1016\/S0304-3975(00)00352-2_BIB15","unstructured":"M. Parigot, \u03bb\u03bc-calculus: an algorithmic interpretation of classical natural deduction, Proceedings of the International Conference on Logic Programming and Automated Reasoning, Lecture Notes in Computer Science, vol. 624, Springer, Berlin, 1992, pp. 199\u2013201."},{"issue":"4","key":"10.1016\/S0304-3975(00)00352-2_BIB16","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.2307\/2275652","article-title":"Proofs of strong normalization for second order classical natural deduction","volume":"62","author":"Parigot","year":"1997","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.1016\/S0304-3975(00)00352-2_BIB17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0304-3975(96)00170-3","article-title":"Intuitionistic and classical natural deduction systems with the catch and the throw rules","volume":"175","author":"Sato","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00352-2_BIB18","doi-asserted-by":"crossref","unstructured":"M. Sato, Classical Brouwer-Heyting-Kolmogorov Interpretation, Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, vol. 1316, Springer, Berlin, 1997, pp. 176\u2013196.","DOI":"10.1007\/3-540-63577-7_43"},{"year":"1984","series-title":"Common Lisp: The Language","author":"Steele","key":"10.1016\/S0304-3975(00)00352-2_BIB19"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003522?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003522?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:45Z","timestamp":1759625565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500003522"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00352-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Strong normalizability of the non-deterministic catch\/throw calculi","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00352-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}