{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171464},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590484"},{"type":"electronic","value":"9783540491781"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0014054","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:50:31Z","timestamp":1132732231000},"page":"201-215","source":"Crossref","is-referenced-by-count":19,"title":["A simple calculus of exception handling"],"prefix":"10.1007","author":[{"given":"Philippe","family":"de Groote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"14_CR1","unstructured":"A. Appel, D.B. MacQueen, R. Milner, and M. Tofte, Unifying exceptions with constructors in standard ML. Technical Report ECS-LFCS-88-55, Laboratory for Foundations of Computer Science, University of Edinburgh, 1988."},{"key":"14_CR2","unstructured":"F. Barbanera and S. Berardi. Continuations and simple types: a strong normalization result. In Proceedings of the ACM SIGPLAN Workshop on Continuations. Report STAN-CS-92-1426, Stanford University, 1992."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"F. Barbanera and S. Berardi. Extracting constructive content from classical logic via control-like reductions. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 45\u201359. Lecture Notes in Computer Science, 664, Springer Verlag, 1993.","DOI":"10.1007\/BFb0037097"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"F. Barbanera and S. Berardi. A symmetric lambda-calculus for \u201cclassical\u201d program extraction. In M. Hagiya and J.C. Mitchell, editors. Proceedings of the International Symposium on Theretical Aspects of Computer Software, pages 494\u2013515. Lecture Notes in Computer Science, 789, Springer Verlag, 1994.","DOI":"10.1007\/3-540-57887-0_112"},{"key":"14_CR5","unstructured":"H.P. Barendregt. The lambda calculus, its syntax and semantics. North-Holland, revised edition, 1984."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"R. Constable and C. Murthy. Finding computational content in classical proofs. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 341\u2013362. Cambridge University Press, 1991.","DOI":"10.1017\/CBO9780511569807.014"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Ph. de Groote. A CPS-translation of the \u03bb\u03bc-calculus. In S. Tison, editor, Proceedings of the 19th International Colloquium on Trees in Algebra and Programming (CAAP'94), pages 85\u201399. Lecture Notes in Computer Science, 787, Springer Verlag, 1994.","DOI":"10.1007\/BFb0017475"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ph. de Groote. On the relation between the \u03bb\u03bc-calculus and the syntactic theory of sequential control. In Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning-LPAR'94, pages 31\u201343. Lecture Notes in Computer Science, 822, Springer Verlag, 1994.","DOI":"10.1007\/3-540-58216-9_27"},{"key":"14_CR9","first-page":"55","volume-title":"Cahiers du Centre de Logique (Universit\u00e9 Catholique de Louvain), Volume 8","author":"J.H. Gallier","year":"1995","unstructured":"J.H. Gallier. On the correspondence between proofs and \u03bb-terms. In Ph. de Groote, editor, Cahiers du Centre de Logique (Universit\u00e9 Catholique de Louvain), Volume 8, pages 55\u2013138. Academia, Louvain-la-Neuve, 1995."},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1017\/S0960129500001328","volume":"1","author":"J.-Y. Girard","year":"1991","unstructured":"J.-Y. Girard. A new constructive logic: Classical logic. Mathematical Structures in Computer Science, 1:255\u2013296, 1991.","journal-title":"Mathematical Structures in Computer Science"},{"key":"14_CR11","unstructured":"J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"T. G. Griffin. A formulae-as-types notion of control. In Conference record of the seventeenth annual ACM symposium on Principles of Programming Languages, pages 47\u201358, 1990.","DOI":"10.1145\/96709.96714"},{"key":"14_CR13","unstructured":"R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. The MIT Press, 1990."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"C. R. Murthy. An evaluation semantics for classical proofs. In Proceedings of the sixth annual IEEE symposium on logic in computer science, pages 96\u2013107, 1991.","DOI":"10.1109\/LICS.1991.151634"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"C. R. Murthy. A computational analysis of Girard's translation and LC. In Proceedings of the seventh annual IEEE symposium on logic in computer science, pages 90\u2013101, 992.","DOI":"10.1109\/LICS.1992.185523"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"M. Parigot. \u03bb\u03bc-Calculus: an algorithmic interpretation of classical natural deduction. In A. Voronkov, editor, Proceedings of the International Conference on Logic Programming and Automated Reasoning, pages 190\u2013201. Lecture Notes in Artificial Intelligence, 624, Springer Verlag, 1992.","DOI":"10.1007\/BFb0013061"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"M. Parigot. Classical proofs as programs. In G. Gottlod, A. Leitsch, and D. Mundici, editors, Proceedings of the third Kurt G\u00f6del colloquium \u2014 KGC'93, pages 263\u2013276. Lecture Notes in Computer Science, 713, Springer Verlag, 1993.","DOI":"10.1007\/BFb0022575"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"M. Parigot. Strong normalization for second order classical natural deduction. In Proceedings of the eighth annual IEEE symposium on logic in computer science, pages 39\u201346, 1993.","DOI":"10.1109\/LICS.1993.287602"},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. D. Plotkin","year":"1975","unstructured":"G. D. Plotkin. Call-by-name, call-by-value and the \u03bb-calculus. Theretical Computer Science, 1:125\u2013159, 1975.","journal-title":"Theretical Computer Science"},{"key":"14_CR20","volume-title":"Natural Deduction, A Proof-Theoretical Study","author":"D. Prawitz","year":"1965","unstructured":"D. Prawitz. Natural Deduction, A Proof-Theoretical Study. Almqvist & Wiksell, Stockholm, 1965."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"N.J. Rehof and M.H. S\u00f8rensen. The \u03bb\u0394-calculus. In M. Hagiya and J.C. Mitchell, editors, Proceedings of the International Symposium on Theoretical Aspects of Computer Software \u2014 TACS'94, pages 516\u2013542. Lecture Notes in Computer Science, 789, Springer Verlag, 1994.","DOI":"10.1007\/3-540-57887-0_113"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:43:52Z","timestamp":1683301432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590484","9783540491781"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0014054","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}