{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:43:00Z","timestamp":1770288180280,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540735946","type":"print"},{"value":"9783540735953","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73595-3_4","type":"book-chapter","created":{"date-parts":[[2007,8,30]],"date-time":"2007-08-30T09:31:33Z","timestamp":1188466293000},"page":"35-50","source":"Crossref","is-referenced-by-count":41,"title":["Barendregt\u2019s Variable Convention in Rule Inductions"],"prefix":"10.1007","author":[{"given":"Christian","family":"Urban","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Berghofer","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Norrish","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., Foster, J.N., 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":"4_CR2","unstructured":"Barendregt, H.: The Lambda Calculus: its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol. 103, North-Holland (1981)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/978-3-540-71389-0_6","volume-title":"Proc.\u00a0of the 10th International Conference on Foundations of Software Science and Computation Structures (FOSSACS)","author":"J. Bengtson","year":"2007","unstructured":"Bengtson, J., Parrow, J.: Formalising the pi-Calculus using Nominal Logic. In: Proc.\u00a0of the 10th International Conference on Foundations of Software Science and Computation Structures (FOSSACS). LNCS, vol.\u00a04423, pp. 63\u201377. Springer, Heidelberg (2007)"},{"key":"4_CR4","first-page":"223","volume-title":"chapter Logical Relations and a Case Study in Equivalence Checking","author":"K. Crary","year":"2005","unstructured":"Crary, K.: Advanced Topics in Types and Programming Languages. In: chapter Logical Relations and a Case Study in Equivalence Checking, pp. 223\u2013244. MIT Press, Cambridge (2005)"},{"key":"4_CR5","unstructured":"Gallier, J.: Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row (1986)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"McKinna, J., Pollack, R.: Some type theory and lambda calculus formalised. Journal of Automated Reasoning 23(1-4) (1999)","DOI":"10.1023\/A:1006294005493"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10990-006-8745-7","volume":"19","author":"M. Norrish","year":"2006","unstructured":"Norrish, M.: Mechanising \u03bb-calculus using a classical first order theory of terms with permutation. Higher-Order and Symbolic Computation\u00a019, 169\u2013195 (2006)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"186","author":"A.M. Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal Logic, A First Order Theory of Names and Binding. Information and Computation\u00a0186, 165\u2013193 (2003)","journal-title":"Information and Computation"},{"key":"4_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/11814771_41","volume-title":"Automated Reasoning","author":"C. Urban","year":"2006","unstructured":"Urban, C., Berghofer, S.: A Recursion Combinator for Nominal Datatypes Implemented in Isabelle\/HOL. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 498\u2013512. Springer, Heidelberg (2006)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1088454.1088458","volume-title":"MERLIN 2005: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding","author":"C. Urban","year":"2005","unstructured":"Urban, C., Norrish, M.: A formal treatment of the Barendregt Variable Convention in rule inductions. In: MERLIN 2005: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, pp. 25\u201332. ACM Press, New York (2005)"},{"key":"4_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/11532231_4","volume-title":"Automated Deduction \u2013 CADE-20","author":"C. Urban","year":"2005","unstructured":"Urban, C., Tasson, C.: Nominal techniques in Isabelle\/HOL. In: Nieuwenhuis, R. (ed.) Automated Deduction \u2013 CADE-20. LNCS (LNAI), vol.\u00a03632, pp. 38\u201353. Springer, Heidelberg (2005)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-48256-3_12","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Wenzel","year":"1999","unstructured":"Wenzel, M.: Isar \u2014 A Generic Interpretative Approach to Readable Formal Proof Documents. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.) TPHOLs 1999. LNCS, vol.\u00a01690, pp. 167\u2013184. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-21"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73595-3_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:53:11Z","timestamp":1619517191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73595-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735946","9783540735953"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73595-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}