{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:06Z","timestamp":1725663606599},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544159"},{"type":"electronic","value":"9783540476177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54415-1_62","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:46:34Z","timestamp":1330209994000},"page":"513-531","source":"Crossref","is-referenced-by-count":0,"title":["Programs with continuations and linear logic"],"prefix":"10.1007","author":[{"given":"Shin-ya","family":"Nishizaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","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:205\u2013237, 1987.","journal-title":"Theoretical Computer Science"},{"key":"25_CR2","unstructured":"A. Filinski. Declarative continuations and categorical duality. Master's thesis, University of Copenhagen, Aug 1989. DIKU Raport Nr. 89\/11, ISSN 0107-8283."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"25_CR4","unstructured":"J.-Y. Girard, P. Taylor, and Y. Lafont. Proofs and Types, volume 7 of Cambridge Tracts in Computer Science. Cambridge University Press, 1989."},{"key":"25_CR5","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, 1990.","DOI":"10.1145\/96709.96714"},{"key":"25_CR6","unstructured":"G. Huet. A uniform approach to type theory. Rapports de Recherche, 795, Feb. 1988."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"C. Murth and R. L. Constable. Finding computational content in classical proofs, July 1990.","DOI":"10.1017\/CBO9780511569807.014"},{"issue":"12","key":"25_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/15042.15043","volume":"21","author":"J. Rees","year":"1986","unstructured":"J. Rees and W. Clinger. Revised3 repord on the algorithmic language scheme. SIGPLAN Notices, 21(12):37\u201379, 1986.","journal-title":"SIGPLAN Notices"},{"key":"25_CR9","unstructured":"J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54415-1_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:29Z","timestamp":1619572889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54415-1_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544159","9783540476177"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-54415-1_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}