{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:29:44Z","timestamp":1648610984184},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/bf00289244","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T23:37:55Z","timestamp":1096933075000},"page":"113-123","source":"Crossref","is-referenced-by-count":2,"title":["On an equivalence between continuation and stack semantics"],"prefix":"10.1007","volume":"8","author":[{"given":"Bruce","family":"Russell","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Gordon, M.: Operational reasoning and denotational semantics. Stanford University Computer Science Department, Report No. STAN-CS-7S-506, 1975"},{"key":"CR2","first-page":"135","volume":"3","author":"C.A.R. Hoare","year":"1974","unstructured":"Hoare, C.A.R., Lauer, P.: Consistent and complementary formal theories of the semantics of programming languages. Acta Informatica 3, 135?153 (1974)","journal-title":"Acta Informatica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/355609.362336","volume":"16","author":"Z. Manna","year":"1973","unstructured":"Manna, Z., Ness, S., Vuillemin, J.: Inductive methods for proving properties of programs. Comm. ACM 16, 491?502 (1973)","journal-title":"Comm. ACM"},{"key":"CR4","volume-title":"Mathematical theory of computation","author":"Z. Manna","year":"1974","unstructured":"Manna, Z.: Mathematical theory of computation. New York: McGraw-Hill 1974"},{"key":"CR5","unstructured":"Milne, R. E.: The formal semantics of computer languages and their implementations. Ph.D. Thesis, Cambridge University and Tech. Microfiche TCF-2, Oxford University Computing Lab., Programming Research Group, 1974"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1145\/800194.805852","volume":"27","author":"J.C. Reynolds","year":"1972","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. Proceedings of the ACM Annual Conference, Vol. 27, pp. 717?740, 1972","journal-title":"Proceedings of the ACM Annual Conference"},{"key":"CR7","unstructured":"Plotkin, G.D.: LCF considered as a programming language. In: Proc. Conf. on Proving and Improving Programs, IRIA, pp. 243?262, 1975"},{"key":"CR8","first-page":"65","volume-title":"Formal semantics of programming languages","author":"D. Scott","year":"1972","unstructured":"Scott, D.: Lattice theory, data types and semantics. In: Formal semantics of programming languages (R. Rustin, ed.), pp. 65?105. Englewood Cliffs, N.J.: Prentice-Hall 1972"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Scott, D.: Data types as lattices. In: Lecture Notes, Amsterdam, 1972. Also in: ISILC, Logic Conference, Kiel, 1974. Lecture Notes in Mathematics, Vol. 499, pp. 579?650. Berlin-Heidelberg-New York: pringer 1975","DOI":"10.1007\/BFb0079432"},{"key":"CR10","first-page":"19","volume-title":"Computers and Automata","author":"D. Scott","year":"1972","unstructured":"Scott, D., Strachey, C.: Towards a mathematical semantics for computer languages. In: Computers and Automata (J. Fox, ed.), pp. 19?46. New York: Wiley 1972"},{"key":"CR11","unstructured":"Strachey, C., Wadsworth, C. P.: Continuations ? a mathematical semantics for handling full jumps. Oxford University Computing Laboratory Technical Monograph PRG-11, 1974"},{"key":"CR12","unstructured":"Walk, K. et al.: Abstract syntax and interpretation of PL\/1. IBM Laboratory Vienna Technical Report, TR25.098, April 1969"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/356596.356598","volume":"4","author":"P. Wegner","year":"1972","unstructured":"Wegner, P.: The Vienna definition language. Computing Survey 4, 5?63 (1972)","journal-title":"Computing Survey"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289244.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289244\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:45Z","timestamp":1554743685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977]]}},"alternative-id":["BF00289244"],"URL":"https:\/\/doi.org\/10.1007\/bf00289244","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977]]}}}