{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T16:54:55Z","timestamp":1674147295521},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7229,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0167-6423(93)90005-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:19:32Z","timestamp":1027657172000},"page":"165-190","source":"Crossref","is-referenced-by-count":6,"title":["Programs with continuations and linear logic"],"prefix":"10.1016","volume":"21","author":[{"given":"Shin-ya","family":"Nishizaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(93)90005-A_BIB1","doi-asserted-by":"crossref","DOI":"10.1145\/96709.96712","article-title":"Explicit substitutions","author":"Abadi","year":"1990","journal-title":"Proceedings 17th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(93)90005-A_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/75277.75303","article-title":"Continuation-passing, closure-passing style","author":"Appel","year":"1989","journal-title":"Proceedings 16th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(93)90005-A_BIB3","article-title":"Dynamic graphs, an alternative way to compute \u03bb-terms","author":"Danos","year":"1989","journal-title":"Proceedings 3rd Italian Conference on Theoretical Computer Science"},{"key":"10.1016\/0167-6423(93)90005-A_BIB4","doi-asserted-by":"crossref","DOI":"10.1145\/91556.91622","article-title":"Abstracting control","author":"Danvy","year":"1990","journal-title":"Proceedings ACM Conference on Lisp and Functional Programming"},{"key":"10.1016\/0167-6423(93)90005-A_BIB5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","article-title":"A syntactic theory of sequential control","volume":"52","author":"Felleisen","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(93)90005-A_BIB6","series-title":"Master's Thesis","article-title":"Declarative continuations and categorical duality","author":"Filinski","year":"1989"},{"issue":"1","key":"10.1016\/0167-6423(93)90005-A_BIB7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/114005.102805","article-title":"Compilation of functional languages by program transformations","volume":"13","author":"Fradet","year":"1991","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0167-6423(93)90005-A_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(93)90005-A_BIB9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1090\/conm\/092\/1003197","article-title":"Categories in Computer Science and Logic","volume":"92","author":"Girard","year":"1989","journal-title":"Contemporary Mathematics"},{"key":"10.1016\/0167-6423(93)90005-A_BIB10","article-title":"Proofs and Types","volume":"7","author":"Girard","year":"1989"},{"key":"10.1016\/0167-6423(93)90005-A_BIB11","series-title":"Higher Set Theory","first-page":"21","volume":"699","author":"Friedman","year":"1978"},{"key":"10.1016\/0167-6423(93)90005-A_BIB12","article-title":"A formulae-as-types notion of control","author":"Griffin","year":"1990","journal-title":"Proceedings 17th Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(93)90005-A_BIB13","series-title":"Proceedings 3rd International Conference on Logic Programming","first-page":"671","article-title":"Logic continuations","author":"Haynes","year":"1986"},{"key":"10.1016\/0167-6423(93)90005-A_BIB14","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/800055.802046","article-title":"Continuations and coroutines","author":"Haynes","year":"1984","journal-title":"Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming"},{"key":"10.1016\/0167-6423(93)90005-A_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(88)90100-4","article-title":"The linear abstract machine","volume":"59","author":"Lafont","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(93)90005-A_BIB16","doi-asserted-by":"crossref","first-page":"682","DOI":"10.2307\/2274322","article-title":"Syntactic translations and provably recursive functions","volume":"50","author":"Leivant","year":"1985","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0167-6423(93)90005-A_BIB17","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0019-9958(71)90355-X","article-title":"Proving algorithms by tail functions","volume":"18","author":"Mazurkiewicz","year":"1971","journal-title":"Inform. and Control"},{"key":"10.1016\/0167-6423(93)90005-A_BIB18","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1145\/361532.361558","article-title":"A bonus from van Wijngaarden's device","volume":"15","author":"Morris","year":"1972","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(93)90005-A_BIB19","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1991.151634","article-title":"An evaluation semantics for classical proofs","author":"Murthy","year":"1991","journal-title":"Proceedings 6th Annual IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0167-6423(93)90005-A_BIB20","author":"Murthy","year":"1990","journal-title":"Finding computational content in classical proofs"},{"issue":"12","key":"10.1016\/0167-6423(93)90005-A_BIB21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/15042.15043","article-title":"Revised3 report on the algorithmic language scheme","volume":"21","author":"Rees","year":"1986","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0167-6423(93)90005-A_BIB22","series-title":"Ai-tr-474","article-title":"Rabbit, a compiler for Scheme","author":"Steele","year":"1978"},{"key":"10.1016\/0167-6423(93)90005-A_BIB23","author":"Steele","year":"1984","journal-title":"Common Lisp: the language"},{"key":"10.1016\/0167-6423(93)90005-A_BIB24","series-title":"Technical Monograph prg-11","article-title":"Continuations: a mathematical semantics for handling full jumps","author":"Strachey","year":"1974"},{"key":"10.1016\/0167-6423(93)90005-A_BIB25","series-title":"Recursive Definition of Syntax and Semantics","first-page":"13","author":"van Wijngaarden","year":"1966"},{"issue":"1","key":"10.1016\/0167-6423(93)90005-A_BIB26","first-page":"174","article-title":"Continuation-based program transformation strategies","volume":"27","author":"Wand","year":"1978","journal-title":"J. ACM"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239390005A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239390005A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T01:59:39Z","timestamp":1621043979000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239390005A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["016764239390005A"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(93)90005-a","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}