{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:15:28Z","timestamp":1648584928877},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T00:00:00Z","timestamp":1193184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2007,11,20]]},"DOI":"10.1007\/s10990-007-9017-x","type":"journal-article","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T16:16:27Z","timestamp":1193156187000},"page":"333-335","source":"Crossref","is-referenced-by-count":1,"title":["State-transition machines, revisited"],"prefix":"10.1007","volume":"20","author":[{"given":"David A.","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,24]]},"reference":[{"key":"9017_CR1","doi-asserted-by":"crossref","unstructured":"Ager, M., Biernacki, D., Danvy, O., Midtgaard, J.: A functional correspondence between evaluators and abstract machines. In: Proc. 5th ACM-SIGPLAN Int. Conf. Principles and Practice of Declarative Programming, pp. 8\u201319 (2003)","DOI":"10.1145\/888251.888254"},{"key":"9017_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-6423(87)90020-7","volume":"8","author":"G. Cousineau","year":"1987","unstructured":"Cousineau, G., Curien, P.-L.: The categorical abstract machine. Sci. Comput. Program. 8, 173\u2013202 (1987)","journal-title":"Sci. Comput. Program."},{"key":"9017_CR3","doi-asserted-by":"crossref","unstructured":"Cr\u00e9gut, P.: An abstract machine for lambda-terms normalization. In: Proc. ACM Symp. Lisp and Functional Programming, pp. 333\u2013340 (1990)","DOI":"10.1145\/91556.91681"},{"key":"9017_CR4","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0304-3975(91)90230-Y","volume":"82","author":"P.-L. Curien","year":"1991","unstructured":"Curien, P.-L.: An abstract framework for environment machines. Theor. Comput. Sci. 82, 389\u2013402 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"9017_CR5","doi-asserted-by":"crossref","unstructured":"Danvy, O.: A rational deconstruction of Landin\u2019s SECD machine. In: 16th Int. Workshop, Implementation and Application of Functional Languages, pp.\u00a052\u201371 (2004). Extended version available as the technical report BRICS RS-03-33","DOI":"10.7146\/brics.v10i33.21801"},{"key":"9017_CR6","first-page":"193","volume-title":"Formal Description of Programming Concepts III","author":"M. Felleisen","year":"1986","unstructured":"Felleisen, M., Friedman, D.: Control operators, the SECD-machine, and the \u03bb-calculus. In: Wirsing, M. (ed.) Formal Description of Programming Concepts III, pp. 193\u2013217. North-Holland, Amsterdam (1986)"},{"key":"9017_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1017\/S0960129500001559","volume":"2","author":"J. Hannan","year":"1992","unstructured":"Hannan, J., Miller, D.: From operational semantics to abstract machines. Math. Struct. Comput. Sci. 2, 415\u2013459 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9017_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Semantics-Directed Compiler Generation","year":"1980","unstructured":"Jones, N. (ed.): Semantics-Directed Compiler Generation. Lecture Notes in Computer Science, vol.\u00a094. Springer, New York (1980)"},{"key":"9017_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-10843-2_10","volume-title":"Int. Conf. on Automata, Languages, and Programming","author":"N. Jones","year":"1981","unstructured":"Jones, N.: Flow analysis of lambda expressions. In: Int. Conf. on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol.\u00a0115, pp. 114\u2013128. Springer, New York (1981)"},{"key":"9017_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/3-540-10250-7_19","volume-title":"Semantics-Directed Compiler Generation","author":"N. Jones","year":"1980","unstructured":"Jones, N., Schmidt, D.: Compiler generation from denotational semantics. In: Jones, N. (ed.) Semantics-Directed Compiler Generation. Lecture Notes in Computer Science, vol.\u00a094, pp. 70\u201393. Springer, New York (1980)"},{"key":"9017_CR11","unstructured":"Krivine, J.-L.: Un interpr\u00e8te du \u03bb-calcul. Brouillon (1985). Available online at http:\/\/www.pps.jussieu.fr\/~krivine\/"},{"key":"9017_CR12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S. Peyton Jones","year":"1992","unstructured":"Peyton Jones, S.: Implementing lazy functional languages on stock hardware: the spineless, tagless G-machine. J. Funct. Program. 2, 127\u2013202 (1992)","journal-title":"J. Funct. Program."},{"key":"9017_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-06841-4_57","volume-title":"Proc. 2d Colloquium on Automata, Languages, and Programming","author":"J. Reynolds","year":"1974","unstructured":"Reynolds, J.: On the relation between direct and continuation semantics. In: Proc. 2d Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, pp. 141\u2013156. Springer, New York (1974)"},{"issue":"4","key":"9017_CR14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1010027404223","volume":"11","author":"J.C. Reynolds","year":"1998","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. Higher-Order Symb. Comput. 11(4), 363\u2013397 (1998)","journal-title":"Higher-Order Symb. Comput."},{"key":"9017_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-10250-7_32","volume-title":"Semantics-Directed Compiler Generation","author":"D. Schmidt","year":"1980","unstructured":"Schmidt, D.: State transition machines for lambda-calculus expressions. In: Jones, N. (ed.) Semantics-Directed Compiler Generation. Lecture Notes in Computer Science, vol.\u00a094, pp. 415\u2013440. Springer, New York (1980)"},{"key":"9017_CR16","volume-title":"Denotational Semantics","author":"D. Schmidt","year":"1986","unstructured":"Schmidt, D.: Denotational Semantics. Allyn and Bacon, Boston (1986)"},{"key":"9017_CR17","volume-title":"Denotational Semantics","author":"J. Stoy","year":"1977","unstructured":"Stoy, J.: Denotational Semantics. MIT Press, Cambridge (1977)"},{"key":"9017_CR18","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C. Wadsworth","year":"1976","unstructured":"Wadsworth, C.: The relation between computational and denotational properties for Scott\u2019s models of the lambda-calculus. SIAM J. Comp. 5, 488\u2013521 (1976)","journal-title":"SIAM J. Comp."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9017-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-007-9017-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9017-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:29:41Z","timestamp":1559352581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-007-9017-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,24]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,11,20]]}},"alternative-id":["9017"],"URL":"https:\/\/doi.org\/10.1007\/s10990-007-9017-x","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,24]]}}}