{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T19:17:31Z","timestamp":1672255051695},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T00:00:00Z","timestamp":1193443200000},"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-9021-1","type":"journal-article","created":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T10:42:15Z","timestamp":1193395335000},"page":"197-198","source":"Crossref","is-referenced-by-count":2,"title":["Editorial"],"prefix":"10.1007","volume":"20","author":[{"given":"Olivier","family":"Danvy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,27]]},"reference":[{"key":"9021_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-61756-6_99","volume-title":"Eighth International Symposium on Programming Language Implementation and Logic Programming","author":"Z.-E.-A. Benaissa","year":"1996","unstructured":"Benaissa, Z.-E.-A., Lescanne, P., Rose, K.H.: Modeling sharing and recursion for weak reduction strategies using explicit substitution. In: Kuchen, H., Swierstra, D. (eds.) Eighth International Symposium on Programming Language Implementation and Logic Programming, Aachen, Germany, September 1996. Lecture Notes in Computer Science, vol. 1140, pp. 393\u2013407. Springer, New York (1996)"},{"key":"9021_CR2","doi-asserted-by":"crossref","unstructured":"Biernacka, M., Danvy, O.: A concrete framework for environment machines. ACM Trans. Comput. Log. (2007, to appear). Available as the research report BRICS RS-06-3","DOI":"10.7146\/brics.v13i3.21909"},{"key":"9021_CR3","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/91556.91681","volume-title":"Proceedings of the 1990 ACM Conference on Lisp and Functional Programming","author":"P. Cr\u00e9gut","year":"1990","unstructured":"Cr\u00e9gut, P.: An abstract machine for lambda-terms normalization. In: Wand, M. (ed.) Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France, June 1990, pp. 333\u2013340. ACM Press, New York (1990)"},{"key":"9021_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":"9021_CR5","unstructured":"Krivine, J.-L.: Un interpr\u00e8te du \u03bb-calcul. Brouillon. Available online at http:\/\/www.pps.jussieu.fr\/~krivine\/ (1985)"},{"issue":"3","key":"9021_CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"P.J. Landin","year":"1966","unstructured":"Landin, P.J.: The next 700 programming languages. Commun. ACM 9(3), 157\u2013166 (1966)","journal-title":"Commun. ACM"},{"key":"9021_CR7","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of 25th ACM National Conference, Boston, MA, 1972, pp. 717\u2013740. Reprinted in Higher-Order Symb. Comput. 11(4), 363\u2013397 (1998), with a\u00a0foreword [9]"},{"issue":"3\/4","key":"9021_CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01019459","volume":"6","author":"J.C. Reynolds","year":"1993","unstructured":"Reynolds, J.C.: The discoveries of continuations. Lisp Symb. Comput. 6(3\/4), 233\u2013247 (1993)","journal-title":"Lisp Symb. Comput."},{"issue":"4","key":"9021_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1023\/A:1010075320153","volume":"11","author":"J.C. Reynolds","year":"1998","unstructured":"Reynolds, J.C.: Definitional interpreters revisited. Higher-Order Symb. Comput. 11(4), 355\u2013361 (1998)","journal-title":"Higher-Order Symb. Comput."},{"key":"9021_CR10","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.A. Schmidt","year":"1980","unstructured":"Schmidt, D.A.: State transition machines for lambda calculus expressions. In: Jones, N.D. (ed.) Semantics-Directed Compiler Generation, Aarhus, Denmark, 1980. Lecture Notes in Computer Science, vol. 94, pp. 415\u2013440. Springer, New York (1980)"},{"issue":"3","key":"9021_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"Sestoft, P.: Deriving a\u00a0lazy abstract machine. J. Funct. Program. 7(3), 231\u2013264 (1997)","journal-title":"J. Funct. Program."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9021-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-007-9021-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9021-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:29:41Z","timestamp":1559338181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-007-9021-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,27]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,11,20]]}},"alternative-id":["9021"],"URL":"https:\/\/doi.org\/10.1007\/s10990-007-9021-1","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,27]]}}}