{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:46Z","timestamp":1759639066520},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635772"},{"type":"electronic","value":"9783540696025"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63577-7_43","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:32:09Z","timestamp":1330299129000},"page":"176-196","source":"Crossref","is-referenced-by-count":2,"title":["Classical Brouwer-Heyting-Kolmogorov interpretation"],"prefix":"10.1007","author":[{"given":"Masahiko","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Barbanera, F. and Berardi, S., A symmetric lambda calculus for \u201cclassical\u201d program extraction, pp. 495\u2013515, in Theoretical Aspects of Computer Software, Lecture Note in Computer Science 789, Hagiya, M. and Mitchell, J.C. (eds.). Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57887-0_112"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Griffin, T., A formulae-as-types notion of control, pp. 47\u201358, in Proc. 17th ACM Symp. on Principle of Programming Languages, ACM Press, 1990.","DOI":"10.1145\/96709.96714"},{"key":"13_CR3","unstructured":"Kameyama, Y., A New Formulation of the Catch\/Throw Mechanism, pp. 106\u2013132, in Second Fuji International Workshop on Functional and Logic Programming, Ida, T., Ohori. A. and Takeichi, M. (eds.), World Scientific, 1997."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Murthy, C., An evaluation semantics for classical proofs, pp. 96\u2013107, Proc. 5th IEEE Symp. Logic in Computer Science, IEEE Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151634"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Nakano, H., A constructive formalization of the catch and throw mechanism, pp. 82\u201389, in Proc. 7th Ann. IEEE Symp. on Logic in Computer Science, 1992.","DOI":"10.1109\/LICS.1992.185522"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Nakano, H., The non-deterministic catch and throw mechanism and its subject reduction property, pp. 61\u201372, in Logic, Language and Computation, Lecture Notes in Computer Science 792, Jones, N. D., Hagiya, M. and Sato, M. (eds.), Springer-Verlag, 1994.","DOI":"10.1007\/BFb0032394"},{"key":"13_CR7","unstructured":"Ong, C.-H.L., A semantic view of classical proofs, pp. 230\u2013241, in Proc. 11th IEEE Ann. Symp. of Logic in Computer Science, Computer Science Press, 1996."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L. and Stewart. C.A., A Curry-Howard foundation for functional computation with control, pp. 215\u2013227, in Proc. 24th Anti. ACM Symp. on Principles of Programming Languages. ACM Press, 1997.","DOI":"10.1145\/263699.263722"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Parigot, M., An algorithmic interpretation of classical natural deduction. pp. 190\u2013210, in Proc. International Conf. on Logic Programming and Automated Reasoning. Lecture Notes in Artificial Intelligence 624, Springer-Verlag, 1992.","DOI":"10.1007\/BFb0013061"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Rehof, N.J. and Sorensen, pp. 516\u2013542, in Theoretical Aspects of Computer Software, Lecture Note in Computer Science 789. Hagiya. M. and Mitchell, J.C. (eds.), Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57887-0_113"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0304-3975(96)00170-3","volume":"175","author":"M. Sato","year":"1997","unstructured":"Sato, M., Intuitionistic and classical natural deduction systems with the catch and the throw rules, pp. 75\u201392, in Theoretical Computer Science 175, 1997.","journal-title":"Theoretical Computer Science"},{"key":"13_CR12","unstructured":"Troelstra, A.S. and van Dalen, D., Constructivism in Mathematics, An Introduction, Studies in Logic and the Foundation of Mathematics 121, North-Holland, 1988."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63577-7_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:15Z","timestamp":1605647955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63577-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635772","9783540696025"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63577-7_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}