{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:51Z","timestamp":1750307331607,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,26]],"date-time":"2011-03-26T00:00:00Z","timestamp":1301097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,26]]},"DOI":"10.1145\/1988783.1988785","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["From type checking by recursive descent to type checking with an abstract machine"],"prefix":"10.1145","author":[{"given":"Ilya","family":"Sergey","sequence":"first","affiliation":[{"name":"Katholieke Universiteit Leuven, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dave","family":"Clarke","sequence":"additional","affiliation":[{"name":"Katholieke Universiteit Leuven, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/888251.888254"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.06.008"},{"key":"e_1_3_2_1_3_1","volume-title":"Deriving Type Systems and Implementations for Coroutines. In APLAS'10: Proceedings of the 8th Asian Symposium on Programming Languages and Systems","volume":"6461","author":"Anton K.","year":"2010","unstructured":"K. Anton and P. Thiemann . Deriving Type Systems and Implementations for Coroutines. In APLAS'10: Proceedings of the 8th Asian Symposium on Programming Languages and Systems , volume 6461 of Lecture Notes in Computer Science, Shanghai, China , 2010 . K. Anton and P. Thiemann. Deriving Type Systems and Implementations for Coroutines. In APLAS'10: Proceedings of the 8th Asian Symposium on Programming Languages and Systems, volume 6461 of Lecture Notes in Computer Science, Shanghai, China, 2010."},{"key":"e_1_3_2_1_5_1","volume-title":"Department of Computer Science","author":"Danvy O.","year":"2006","unstructured":"O. Danvy . An Analytical Approach to Program as Data Objects. DSc Thesis , Department of Computer Science , Aarhus University , October 2006 . O. Danvy. An Analytical Approach to Program as Data Objects. DSc Thesis, Department of Computer Science, Aarhus University, October 2006."},{"key":"e_1_3_2_1_6_1","first-page":"66","volume-title":"Advanced Functional Programming, Sixth International School, number 5382","author":"Danvy O.","year":"2008","unstructured":"O. Danvy . From Reduction-Based to Reduction-Free Normalization . In P. Koopman, R. Plasmeijer, and D. Swierstra, editors, Advanced Functional Programming, Sixth International School, number 5382 , pages 66 -- 164 , Nijmegen, The Netherlands , May 2008 . Springer . Lecture notes including 70+ exercises. O. Danvy. From Reduction-Based to Reduction-Free Normalization. In P. Koopman, R. Plasmeijer, and D. Swierstra, editors, Advanced Functional Programming, Sixth International School, number 5382, pages 66--164, Nijmegen, The Netherlands, May 2008. Springer. Lecture notes including 70+ exercises."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91622"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001535"},{"key":"e_1_3_2_1_9_1","volume-title":"November","author":"Danvy O.","year":"2008","unstructured":"O. Danvy and K. Millikin . A Rational Deconstruction of Landin's SECD Machine with the J Operator. Logical Methods in Computer Science, 4(4) , November 2008 . O. Danvy and K. Millikin. A Rational Deconstruction of Landin's SECD Machine with the J Operator. Logical Methods in Computer Science, 4(4), November 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12251-4_18"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/773184.773202"},{"key":"e_1_3_2_1_12_1","unstructured":"O.\n      Danvy\n     and \n      I.\n      Zerny\n  . \n  Three syntactic theories for combinatory graph reduction\n  . In M. Alpuente editor LOPSTR'10-20th International Symposium on \n  Logic-Based Program Synthesis and Transformation volume 10--\n  14\n   of \n  RISC-Linz Report Series pages \n  3\n  --\n  32 2010\n  .   O. Danvy and I. Zerny. Three syntactic theories for combinatory graph reduction. In M. Alpuente editor LOPSTR'10-20th International Symposium on Logic-Based Program Synthesis and Transformation volume 10--14 of RISC-Linz Report Series pages 3--32 2010."},{"key":"e_1_3_2_1_13_1","volume-title":"3rd Working Conference on the Formal Description of Programming Concepts","author":"Felleisen M.","year":"1986","unstructured":"M. Felleisen and D. P. Friedman . Control operators, the SECD-machine, and the lambda-calculus . In 3rd Working Conference on the Formal Description of Programming Concepts , August 1986 . M. Felleisen and D. P. Friedman. Control operators, the SECD-machine, and the lambda-calculus. In 3rd Working Conference on the Formal Description of Programming Concepts, August 1986."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.177858"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001559"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645420.652541"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762174.1762214"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/549659"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"Nielson F.","year":"1999","unstructured":"F. Nielson , H. R. Nielson , and C. Hankin . Principles of Program Analysis . Springer , corrected edition, October 1999 . F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer, corrected edition, October 1999."},{"key":"e_1_3_2_1_22_1","volume-title":"Types and Programming Languages","author":"Pierce B. C.","year":"2002","unstructured":"B. C. Pierce . Types and Programming Languages . MIT Press , Cambridge, MA, USA , 2002 . B. C. Pierce. Types and Programming Languages. MIT Press, Cambridge, MA, USA, 2002."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/800194.805852"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010075320153"},{"key":"e_1_3_2_1_25_1","volume-title":"Katholieke Universiteit Leuven","author":"Sergey I.","year":"2010","unstructured":"I. Sergey and D. Clarke . A Correspondence between Type Checking via Reduction and Type Checking via Evaluation . Katholieke Universiteit Leuven , December 2010 . I. Sergey and D. Clarke. A Correspondence between Type Checking via Reduction and Type Checking via Evaluation. Katholieke Universiteit Leuven, December 2010."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006466"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1093"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11417170_30"}],"event":{"name":"LDTA '11: Language Descriptions, Tools, and Applications","sponsor":["University of Minnesota Software Engineering Center","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Saarbrucken Germany","acronym":"LDTA '11"},"container-title":["Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1988783.1988785","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1988783.1988785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:08Z","timestamp":1750244768000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1988783.1988785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,26]]},"references-count":27,"alternative-id":["10.1145\/1988783.1988785","10.1145\/1988783"],"URL":"https:\/\/doi.org\/10.1145\/1988783.1988785","relation":{},"subject":[],"published":{"date-parts":[[2011,3,26]]},"assertion":[{"value":"2011-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}