{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:08:04Z","timestamp":1725638884121},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642253171"},{"type":"electronic","value":"9783642253188"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25318-8_27","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T21:54:45Z","timestamp":1322949285000},"page":"369-383","source":"Crossref","is-referenced-by-count":1,"title":["A Semantics for Context-Sensitive Reduction Semantics"],"prefix":"10.1007","author":[{"given":"Casey","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jay","family":"McCarthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Jaconette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert Bruce","family":"Findler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0956796897002724","volume":"7","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Felleisen, M.: The Call-by-Need Lambda-Calculus. J. Functional Programming\u00a07(3), 265\u2013301 (1997)","journal-title":"J. Functional Programming"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11541868_4","volume-title":"Theorem Proving in Higher Order Logics","author":"B.E. Aydemir","year":"2005","unstructured":"Aydemir, B.E., Bohannon, A., Fairbairn, M., Nathan Foster, J., Pierce, B.C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized Metatheory for the Masses: The POPLmark Challenge. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 50\u201365. Springer, Heidelberg (2005)"},{"key":"27_CR3","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. North-Holland (1984)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Chang, S., Felleisen, M.: The Call-by-need Lambda Calculus (unpublished manuscript, 2011)","DOI":"10.1007\/978-3-642-28869-2_7"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Danvy, O., Nielsen, L.R.: Refocusing in Reduction Semantics. Aarhus University, BRICS RS-04-26 (2004)","DOI":"10.7146\/brics.v11i26.21851"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44659-1_9","volume-title":"Theorem Proving in Higher Order Logics","author":"C. Dubois","year":"2000","unstructured":"Dubois, C.: Proving ML Type Soundness within Coq. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol.\u00a01869, pp. 126\u2013144. Springer, Heidelberg (2000)"},{"key":"27_CR7","unstructured":"Felleisen, M., Findler, R.B., Flatt, M.: Semantics Engineering with PLT Redex. MIT Press (2010)"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M. Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The Revised Report on the Syntactic Theories of Squential Control and State. Theoretical Computer Science\u00a0103(2), 235\u2013271 (1992)","journal-title":"Theoretical Computer Science"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Flatt, M., Yu, G., Findler, R.B., Felleisen, M.: Adding Delimited and Composable Control to a Production Programming Environment. In: Proc. ACM Intl. Conf. Functional Programming, pp. 165\u2013176 (2007)","DOI":"10.1145\/1291151.1291178"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Frost, R.A., Hafiz, R., Callaghan, P.C.: Modular and Efficient Top-Down Parsing for Ambiguous Left-Recursive Grammars. In: Proc. International Conference on Parsing Technology, pp. 109\u2013120 (2007)","DOI":"10.3115\/1621410.1621425"},{"key":"27_CR11","unstructured":"Klein, C., Flatt, M., Findler, R.B.: The Racket Virtual Machine and Randomized Testing (2010), http:\/\/plt.eecs.northwestern.edu\/racket-machine\/"},{"issue":"7","key":"27_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/364995.365689","volume":"8","author":"S. Kuno","year":"1965","unstructured":"Kuno, S.: The Predictive Analyzer and a Path Elimination Technique. Communications of the ACM\u00a08(7), 453\u2013462 (1965)","journal-title":"Communications of the ACM"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-60609-2_25","volume-title":"SOFSEM \u201995: Theory and Practice of Informatics","author":"S. Lucas","year":"1995","unstructured":"Lucas, S.: Fundamentals of Context-Sensitive Rewriting. In: Bartosek, M., Staudek, J., Wiedermann, J. (eds.) SOFSEM 1995. LNCS, vol.\u00a01012, pp. 405\u2013412. Springer, Heidelberg (1995)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-25979-4_21","volume-title":"Rewriting Techniques and Applications","author":"J. Matthews","year":"2004","unstructured":"Matthews, J., Findler, R.B., Flatt, M., Felleisen, M.: A Visual Environment for Developing Context-Sensitive Term Rewriting Systems. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 301\u2013311. Springer, Heidelberg (2004)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Sieczkowski, F., Biernacka, M., Biernacki, D.: Automating Derivations of Abstract Machines from Reduction Semantics: A Generic Formalization of Refocusing in Coq. In: Proc. Symp. Implementation and Application of Functional Languages. To appear in LNCS (2010)","DOI":"10.1007\/978-3-642-24276-2_5"},{"key":"27_CR16","unstructured":"Sperber, M., Kent Dybvig, R., Flatt, M., van Straaten, A., Kelsey, R., Clinger, W., Rees, J., Findler, R.B., Matthews, J.: Revised [6] Report on the Algorithmic Language Scheme. Cambridge University Press (2007)"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Warth, A., Douglass, J.R., Millstein, T.: Packrat Parsers Can Support Left Recursion. In: Proc. ACM SIGPLAN Wksp. Partial Evaluation and Program Manipulation, pp. 103\u2013110 (2008)","DOI":"10.1145\/1328408.1328424"},{"issue":"4","key":"27_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1014408032446","volume":"14","author":"Y. Xiao","year":"2001","unstructured":"Xiao, Y., Sabry, A., Ariola, Z.M.: From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition. Higher-Order and Symbolic Computation\u00a014(4), 387\u2013409 (2001)","journal-title":"Higher-Order and Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25318-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T08:00:41Z","timestamp":1561017641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25318-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642253171","9783642253188"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25318-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}