{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:11:50Z","timestamp":1766733110759,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466681"},{"type":"electronic","value":"9783662466698"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46669-8_9","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T14:37:37Z","timestamp":1427899057000},"page":"205-231","source":"Crossref","is-referenced-by-count":41,"title":["A Theory of Name Resolution"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Neron","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Tolmach","sequence":"additional","affiliation":[]},{"given":"Eelco","family":"Visser","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Wachsmuth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley (1986)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Aydemir, B.E., Chargu\u00e9raud, A., Pierce, B.C., Pollack, R., Weirich, S.: Engineering formal metatheory. In: Necula, G.C., Wadler, P. (eds.) Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, pp. 3\u201315. ACM (2008)","DOI":"10.1145\/1328438.1328443"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10817-011-9225-2","volume":"49","author":"A. Chargu\u00e9raud","year":"2012","unstructured":"Chargu\u00e9raud, A.: The locally nameless representation. Journal of Automated Reasoning\u00a049(3), 363\u2013408 (2012)","journal-title":"Journal of Automated Reasoning"},{"key":"9_CR4","unstructured":"Cheney, J.: Toward a general theory of names: binding and scope. In: Pollack, R. (ed.) ACM SIGPLAN International Conference on Functional Programming, Workshop on Mechanized Reasoning About Languages with Variable Binding, MERLIN 2005, Tallinn, Estonia, pp. 33\u201340. ACM (September 30, 2005)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Chlipala, A.J.: A verified compiler for an impure functional language. In: Hermenegildo, M.V., Palsberg, J. (eds.) Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, pp. 93\u2013106. ACM (2010)","DOI":"10.1145\/1706299.1706312"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Churchill, M., Mosses, P.D., Torrini, P.: Reusable components of semantic specifications. In: Binder, W., Ernst, E., Peternier, A., Hirschfeld, R. (eds.) 13th International Conference on Modularity, MODULARITY 2014, Lugano, Switzerland, April 22-26, pp. 145\u2013156. ACM (2014)","DOI":"10.1145\/2577080.2577099"},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N.G. Bruijn de","year":"1972","unstructured":"de Bruijn, N.G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae\u00a034(5), 381\u2013392 (1972)","journal-title":"Indagationes Mathematicae"},{"issue":"4","key":"9_CR8","first-page":"295","volume":"5","author":"R.K. Dybvig","year":"1992","unstructured":"Dybvig, R.K., Hieb, R., Bruggeman, C.: Syntactic abstraction in scheme. Higher-Order and Symbolic Computation\u00a05(4), 295\u2013326 (1992)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-662-44202-9_20","volume-title":"ECOOP 2014 \u2013 Object-Oriented Programming","author":"S. Erdweg","year":"2014","unstructured":"Erdweg, S., van der Storm, T., Dai, Y.: Capture-avoiding and hygienic program transformations. In: Jones, R. (ed.) ECOOP 2014. LNCS, vol.\u00a08586, pp. 489\u2013514. Springer, Heidelberg (2014)"},{"issue":"3-5","key":"9_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M. Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput.\u00a013(3-5), 341\u2013363 (2002)","journal-title":"Formal Asp. Comput."},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6423(02)00109-0","volume":"47","author":"G. Hedin","year":"2003","unstructured":"Hedin, G., Magnusson, E.: Jastadd\u2013an aspect-oriented compiler construction system. Science of Computer Programming\u00a047(1), 37\u201358 (2003)","journal-title":"Science of Computer Programming"},{"key":"9_CR12","unstructured":"Herman, D.: A Theory of Hygienic Macros. PhD thesis, Northeastern University, Boston, Massachusetts (May 2010)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-78739-6_4","volume-title":"Programming Languages and Systems","author":"D. Herman","year":"2008","unstructured":"Herman, D., Wand, M.: A theory of hygienic macros. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol.\u00a04960, pp. 48\u201362. Springer, Heidelberg (2008)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Kats, L.C.L., Visser, E.: The Spoofax language workbench: rules for declarative specification of languages and IDEs. In: Cook, W.R., Clarke, S., Rinard, M.C. (eds.) Proceedings of the 25th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2010, Reno\/Tahoe, Nevada, pp. 444\u2013463. ACM (2010)","DOI":"10.1145\/1869459.1869497"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Klein, C., Clements, J., Dimoulas, C., Eastlund, C., Felleisen, M., Flatt, M., McCarthy, J.A., Rafkind, J., Tobin-Hochstadt, S., Findler, R.B.: Run your research: on the effectiveness of lightweight mechanization. In: Field, J., Hicks, M. (eds.) Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, January 22-28, pp. 285\u2013296. ACM (2012)","DOI":"10.1145\/2103656.2103691"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-36089-3_18","volume-title":"Software Language Engineering","author":"G. Konat","year":"2013","unstructured":"Konat, G., Kats, L., Wachsmuth, G., Visser, E.: Declarative name binding and scope rules. In: Czarnecki, K., Hedin, G. (eds.) SLE 2012. LNCS, vol.\u00a07745, pp. 311\u2013331. Springer, Heidelberg (2013)"},{"key":"9_CR17","unstructured":"Leroy, X., Doligez, D., Frisch, A., Garrigue, J., R\u00e9my, D., Vouillon, J.: The OCaml system (release 4.00): Documentation and user\u2019s manual. Institut National de Recherche en Informatique et en Automatique (July 2012)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.jlap.2004.03.008","volume":"61-61","author":"P.D. Mosses","year":"2004","unstructured":"Mosses, P.D.: Modular structural operational semantics. Journal of Logic and Algebraic Programming\u00a061-61, 195\u2013228 (2004)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Neron, P., Tolmach, A.P., Visser, E., Wachsmuth, G.: A theory of name resolution with extended coverage and proofs. Technical Report TUD-SERG-2015-001, Software Engineering Research Group. Delft University of Technology, Extended version of this paper (January 2015)","DOI":"10.1007\/978-3-662-46669-8_9"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Wexelblat, R.L. (ed.) Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation (PLDI), Atlanta, Georgia, USA, June 22-24, pp. 199\u2013208. ACM (1988)","DOI":"10.1145\/53990.54010"},{"key":"9_CR21","volume-title":"Types and Programming Languages","author":"B.C. Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"issue":"1","key":"9_CR22","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1017\/S0956796809990293","volume":"20","author":"P. Sewell","year":"2010","unstructured":"Sewell, P., Nardelli, F.Z., Owens, S., Peskine, G., Ridge, T., Sarkar, S., Strnisa, R.: Ott: Effective tool support for the working semanticist. Journal of Functional Programming\u00a020(1), 71\u2013122 (2010)","journal-title":"Journal of Functional Programming"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Stansifer, P., Wand, M.: Romeo: A system for more flexible binding-safe programming. In: Jeuring, J., Chakravarty, M.M.T. (eds.) Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming, Gothenburg, Sweden, September 1-3, pp. 53\u201365. ACM (2014)","DOI":"10.1145\/2692915.2628162"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Visser, E., Wachsmuth, G., Tolmach, A.P., Neron, P., Vergu, V.A., Passalaqua, A., Konat, G.D.P.: A language designer\u2019s workbench: A one-stop-shop for implementation and verification of language designs. In: Black, A.P., Krishnamurthi, S., Bruegge, B., Ruskiewicz, J.N. (eds.) Onward! 2014, Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software, part of SLASH 2014, Portland, OR, USA, October 20-24, pp. 95\u2013111. ACM (2014)","DOI":"10.1145\/2661136.2661149"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Weirich, S., Yorgey, B.A., Sheard, T.: Binders unbound. In: Chakravarty, M.M.T., Hu, Z., Danvy, O. (eds.) Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011, Tokyo, Japan, September 19-21, pp. 333\u2013345. ACM (2011)","DOI":"10.1145\/2034773.2034818"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46669-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:23:21Z","timestamp":1559139801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46669-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466681","9783662466698"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46669-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}