{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:12Z","timestamp":1761611172413},"publisher-location":"Berlin\/Heidelberg","reference-count":5,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540579354"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032394","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:30:32Z","timestamp":1134264632000},"page":"61-72","source":"Crossref","is-referenced-by-count":2,"title":["The non-deterministic catch and throw mechanism and its subject reduction property"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Nakano","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M. Felleisen","year":"1987","unstructured":"M. Felleisen, D. Friedman, E. Kohlbecker, and B. Duba, A syntactic theory of sequential control, Theoretical Computer Science 52 (1987) 205\u2013237.","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"T. G. Griffin, A formulae-as-types notion of control, Conf. Rec. ACM Symp. on Principles of Programming Languages (1990) 47\u201358.","DOI":"10.1145\/96709.96714"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"C. R. Murthy, An evaluation semantics for classical proofs, Proc. the 6th Annual IEEE Symp. on Logic in Computer Science (1991) 96\u2013107.","DOI":"10.1109\/LICS.1991.151634"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"H. Nakano, A Constructive Formalization of the Catch and Throw Mechanism, Proc. the 7th Annual IEEE Symp. on Logic in Computer Science (1992) 82\u201389.","DOI":"10.1109\/LICS.1992.185522"},{"key":"4_CR5","doi-asserted-by":"publisher","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, Theoretical Computer Science 1 (1975) 125\u2013159.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Logic, Language and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:47:16Z","timestamp":1586598436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540579354"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0032394","relation":{},"subject":[]}}