{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:13Z","timestamp":1750307713624,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,2]],"date-time":"2009-08-02T00:00:00Z","timestamp":1249171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CSR\/EHS 0720857CCF 0841554"],"award-info":[{"award-number":["CSR\/EHS 0720857CCF 0841554"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CSR\/EHS 0720857CCF 0841554"],"award-info":[{"award-number":["CSR\/EHS 0720857CCF 0841554"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,8,2]]},"DOI":"10.1145\/1577824.1577836","type":"proceedings-article","created":{"date-parts":[[2009,8,4]],"date-time":"2009-08-04T13:38:06Z","timestamp":1249393086000},"page":"74-83","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["The calculus of nominal inductive constructions"],"prefix":"10.1145","author":[{"given":"Edwin","family":"Westbrook","sequence":"first","affiliation":[{"name":"Rice University"}]},{"given":"Aaron","family":"Stump","sequence":"additional","affiliation":[{"name":"The University of Iowa"}]},{"given":"Evan","family":"Austin","sequence":"additional","affiliation":[{"name":"The University of Kansas"}]}],"member":"320","published-online":{"date-parts":[[2009,8,2]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"69","volume-title":"Proceedings of the First International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2006","author":"Aydemir B.","year":"2007","unstructured":"B. Aydemir , A. Bohannon , and S. Weirich . Nominal reasoning techniques in Coq (extended abstract) . In Proceedings of the First International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2006 ), pages 69 -- 77 , 2007 . B. Aydemir, A. Bohannon, and S. Weirich. Nominal reasoning techniques in Coq (extended abstract). In Proceedings of the First International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2006), pages 69--77, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_28"},{"key":"e_1_3_2_1_3_1","volume-title":"Its Syntax and Semantics. North-Holland","author":"Barendregt H.","year":"1984","unstructured":"H. Barendregt . The Lambda Calculus , Its Syntax and Semantics. North-Holland , 1984 . H. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North-Holland, 1984."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","author":"Cheney J.","year":"2008","unstructured":"J. Cheney . Simple nominal type theory . In Proceedings of the International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice , 2008 . J. Cheney. Simple nominal type theory. In Proceedings of the International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2008."},{"key":"e_1_3_2_1_5_1","volume-title":"Electronic Proceedings of the Third Annual BRA Workshop on Logical frameworks","author":"Coquand T.","year":"1992","unstructured":"T. Coquand . Pattern matching with dependent types. In B. Nordström, K. Petersson, and G. Plotkin, editors , Electronic Proceedings of the Third Annual BRA Workshop on Logical frameworks , 1992 . T. Coquand. Pattern matching with dependent types. In B. Nordström, K. Petersson, and G. Plotkin, editors, Electronic Proceedings of the Third Annual BRA Workshop on Logical frameworks, 1992."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237792"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001650200016"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/788021.788940"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017472.1017477"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224225"},{"key":"e_1_3_2_1_11_1","first-page":"65","volume-title":"Proceedings of the Workshop on MEchanized Reasoning about Languages with variable bINding (MERLIN '01)","author":"Miculan M.","year":"2001","unstructured":"M. Miculan . Developing (meta)theory of λ-calculus in the theory of contexts . In Proceedings of the Workshop on MEchanized Reasoning about Languages with variable bINding (MERLIN '01) , pages 65 -- 81 , 2001 . M. Miculan. Developing (meta)theory of λ-calculus in the theory of contexts. In Proceedings of the Workshop on MEchanized Reasoning about Languages with variable bINding (MERLIN '01), pages 65--81, 2001."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/1.4.497"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094622.1094628"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","volume-title":"Isabelle\/HOL -- A Proof Assistant for Higher-Order Logic","author":"Nipkow T.","year":"2002","unstructured":"T. Nipkow , L. Paulson , and M. Wenzel . Isabelle\/HOL -- A Proof Assistant for Higher-Order Logic , volume 2283 of LNCS . Springer , 2002 . T. Nipkow, L. Paulson, and M. Wenzel. Isabelle\/HOL -- A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.175187"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54010"},{"key":"e_1_3_2_1_17_1","volume-title":"System. Description: Twelf-- AMeta-Logical Framework for Deductive Systems. In 16th International Conference on Automated Deduction","author":"Pfenning F.","year":"1999","unstructured":"F. Pfenning and C. Sch ürmann. System. Description: Twelf-- AMeta-Logical Framework for Deductive Systems. In 16th International Conference on Automated Deduction , 1999 . F. Pfenning and C. Schürmann. System. Description: Twelf-- AMeta-Logical Framework for Deductive Systems. In 16th International Conference on Automated Deduction, 1999."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328483"},{"key":"e_1_3_2_1_19_1","series-title":"LNCS","first-page":"235","volume-title":"Computer Science Logic (CSL '04)","author":"Sch U.","year":"2004","unstructured":"U. Sch öpp and I. Stark . A dependent type theory with names and binding . In Computer Science Logic (CSL '04) , volume 3210 of LNCS , pages 235 -- 249 , 2004 . U. Schöpp and I. Stark. A dependent type theory with names and binding. In Computer Science Logic (CSL '04), volume 3210 of LNCS, pages 235--249, 2004."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00418-7"},{"key":"e_1_3_2_1_21_1","first-page":"93","volume-title":"17th European Symposium on Programming (ESOP '08)","author":"Sch C.","year":"2008","unstructured":"C. Sch ürmann and A. Poswolsky . Practical programming with higher-order encodings and dependent types . In 17th European Symposium on Programming (ESOP '08) , pages 93 -- 107 , 2008 . C. Schürmann and A. Poswolsky. Practical programming with higher-order encodings and dependent types. In 17th European Symposium on Programming (ESOP '08), pages 93--107, 2008."},{"key":"e_1_3_2_1_22_1","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"TeReSe , editor. Term Rewriting Systems , volume 55 of Cambridge Tracts in Theoretical Computer Science . Cambridge University Press , 2003 . TeReSe, editor. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003."},{"key":"e_1_3_2_1_23_1","volume-title":"Version V8.0","author":"Development Team The Coq","year":"2004","unstructured":"The Coq Development Team . The Coq Proof Assistant Reference Manual , Version V8.0 , 2004 . http:\/\/coq.inria.fr. The Coq Development Team. The Coq Proof Assistant Reference Manual, Version V8.0, 2004. http:\/\/coq.inria.fr."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-008-9097-2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944728"}],"event":{"name":"LFMTP '09: Theory and Practice","sponsor":["CADE-22"],"location":"Montreal Quebec Canada","acronym":"LFMTP '09"},"container-title":["Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1577824.1577836","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1577824.1577836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:16Z","timestamp":1750253416000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1577824.1577836"}},"subtitle":["an intensional approach to encoding name-bindings"],"short-title":[],"issued":{"date-parts":[[2009,8,2]]},"references-count":25,"alternative-id":["10.1145\/1577824.1577836","10.1145\/1577824"],"URL":"https:\/\/doi.org\/10.1145\/1577824.1577836","relation":{},"subject":[],"published":{"date-parts":[[2009,8,2]]},"assertion":[{"value":"2009-08-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}