{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:29Z","timestamp":1772163989295,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T00:00:00Z","timestamp":1379894400000},"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":[[2013,9,23]]},"DOI":"10.1145\/2503778.2503780","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T15:57:05Z","timestamp":1379433425000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Names for free"],"prefix":"10.1145","author":[{"given":"Jean-Philippe","family":"Bernardy","sequence":"first","affiliation":[{"name":"Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden"}]},{"given":"Nicolas","family":"Pouillard","sequence":"additional","affiliation":[{"name":"IT University of Copenhagen, Copenhagen, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2013,9,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0037095","volume-title":"Typed Lambda Calculi and Applications, LNCS 664","author":"Altenkirch T.","year":"1993","unstructured":"T. Altenkirch . A formalization of the strong normalization proof for System F in LEGO . In J. G. M. Bezem, editor, Typed Lambda Calculi and Applications, LNCS 664 , pages 13 -- 28 , 1993 . URL http:\/\/www.cs.nott.ac.uk\/txa\/publ\/tlca93.pdf. T. Altenkirch. A formalization of the strong normalization proof for System F in LEGO. In J. G. M. Bezem, editor, Typed Lambda Calculi and Applications, LNCS 664, pages 13--28, 1993. URL http:\/\/www.cs.nott.ac.uk\/txa\/publ\/tlca93.pdf."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/647849.737066"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646529.695204"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02273-9_5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(94)00022-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.25"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500577"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796812000056"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003366"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789277.1789282"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411226"},{"key":"e_1_3_2_1_12_1","volume-title":"Lambda calculus notation with nameless dummies. In phIndagationes Mathematicae","author":"de Bruijn N. G.","year":"1972","unstructured":"972)}de_bruijn_lambda_1972 N. G. de Bruijn . Lambda calculus notation with nameless dummies. In phIndagationes Mathematicae , volume 34 . Elsevier , 1972 . 972)}de_bruijn_lambda_1972N. G. de Bruijn. Lambda calculus notation with nameless dummies. In phIndagationes Mathematicae, volume 34. Elsevier, 1972."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237792"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291201.1291212"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411218"},{"key":"e_1_3_2_1_16_1","first-page":"381","volume-title":"CSL","author":"Keller C.","year":"2012","unstructured":"C. Keller and M. Lasson . Parametricity in an impredicative sort . In CSL , pages 381 -- 395 , 2012 . C. Keller and M. Lasson. Parametricity in an impredicative sort. In CSL, pages 381--395, 2012."},{"key":"e_1_3_2_1_17_1","volume-title":"Bound: Making de Bruijn Succ less","author":"Kmett E.","year":"2012","unstructured":"E. Kmett . Bound: Making de Bruijn Succ less , 2012 . URL http:\/\/hackage.haskell.org\/package\/bound. Haskell package. E. Kmett. Bound: Making de Bruijn Succ less, 2012. URL http:\/\/hackage.haskell.org\/package\/bound. Haskell package."},{"key":"e_1_3_2_1_18_1","volume-title":"i am a classy hack","author":"McBride C.","year":"2010","unstructured":"C. McBride . I am not a number , i am a classy hack , 2010 . URL http:\/\/www.e-pig.org\/epilogue\/?p=773. Weblog entry. C. McBride. I am not a number, i am a classy hack, 2010. URL http:\/\/www.e-pig.org\/epilogue\/?p=773. Weblog entry."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004829"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006326"},{"key":"e_1_3_2_1_21_1","volume-title":"IEEE Computer Society","author":"Miller D. A.","year":"2003","unstructured":"D. A. Miller and A. F. Tiu . A proof theory for generic judgments: An extended abstract. In phProceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, pages 118--127 . IEEE Computer Society , June 2003 . D. A. Miller and A. F. Tiu. A proof theory for generic judgments: An extended abstract. In phProceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, pages 118--127. IEEE Computer Society, June 2003."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352582.1352591"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796812000251"},{"key":"e_1_3_2_1_24_1","first-page":"513","volume-title":"abstraction and parametric polymorphism. In phInformation Processing 83","author":"Reynolds J. C.","year":"1983","unstructured":"J. C. Reynolds . Types , abstraction and parametric polymorphism. In phInformation Processing 83 , pages 513 -- 523 . Elsevier Science , 1983 . URL ftp:\/\/ftp.cs.cmu.edu\/user\/jcr\/typesabpara.pdf. J. C. Reynolds. Types, abstraction and parametric polymorphism. In phInformation Processing 83, pages 513--523. Elsevier Science, 1983. URL ftp:\/\/ftp.cs.cmu.edu\/user\/jcr\/typesabpara.pdf."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944728"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2013 ACM SIGPLAN symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503778.2503780","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2503778.2503780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:27Z","timestamp":1750217307000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503778.2503780"}},"subtitle":["polymorphic views of names and binders"],"short-title":[],"issued":{"date-parts":[[2013,9,23]]},"references-count":25,"alternative-id":["10.1145\/2503778.2503780","10.1145\/2503778"],"URL":"https:\/\/doi.org\/10.1145\/2503778.2503780","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578854.2503780","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,23]]},"assertion":[{"value":"2013-09-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}