{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T17:12:54Z","timestamp":1760548374842},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540488156"},{"type":"electronic","value":"9783540488163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11921240_14","type":"book-chapter","created":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T13:28:19Z","timestamp":1162474099000},"page":"198-212","source":"Crossref","is-referenced-by-count":9,"title":["Capture-Avoiding Substitution as a Nominal Algebra"],"prefix":"10.1007","author":[{"given":"Murdoch J.","family":"Gabbay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aad","family":"Mathijssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8130-3","volume-title":"A Course in Universal Algebra","author":"S. Burris","year":"1981","unstructured":"Burris, S., Sankappanavar, H.: A Course in Universal Algebra. Springer, Heidelberg (1981) (available online)"},{"issue":"1\u20133","key":"14_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.tcs.2004.06.016","volume":"323","author":"C. Urban","year":"2004","unstructured":"Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. Theoretical Computer Science\u00a0323(1\u20133), 473\u2013497 (2004)","journal-title":"Theoretical Computer Science"},{"key":"14_CR3","unstructured":"Gabbay, M.J., Mathijssen, A.: Nominal algebra. In: STACS 2007 (submitted, 2006)"},{"key":"14_CR4","unstructured":"Gabbay, M.J., Bul\u00f2, S.R., Marin, A.: Substitution as an abstract notion: holy functions. In: STACS 2007 (submitted, 2006)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/1140335.1140359","volume-title":"PPDP 2006: Proceedings of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming","author":"M.J. Gabbay","year":"2006","unstructured":"Gabbay, M.J., Mathijssen, A.: One-and-a-halfth-order logic. In: PPDP 2006: Proceedings of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming, pp. 189\u2013200. ACM Press, New York (2006)"},{"issue":"3\u20135","key":"14_CR6","first-page":"341","volume":"13","author":"M.J. Gabbay","year":"2001","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013(3\u20135), 341\u2013363 (2001)","journal-title":"Formal Aspects of Computing"},{"key":"14_CR7","first-page":"1","volume-title":"Handbook of Philosophical Logic","author":"W. Hodges","year":"2001","unstructured":"Hodges, W.: Elementary predicate logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol.\u00a01, pp. 1\u2013131. Kluwer, Dordrecht (2001)","edition":"2"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/1013963.1013978","volume-title":"Proc. 6th Int. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP 2004)","author":"M. Fern\u00e1ndez","year":"2004","unstructured":"Fern\u00e1ndez, M., Gabbay, M.J., Mackie, I.: Nominal rewriting systems. In: Proc. 6th Int. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP 2004), pp. 108\u2013119. ACM, New York (2004)"},{"key":"14_CR9","unstructured":"Fern\u00e1ndez, M., Gabbay, M.J.: Nominal rewriting. Journal version, Information and Computation (submitted, 2005)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/1069774.1069779","volume-title":"Proc. 7th Int. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP 2005)","author":"M. Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M., Gabbay, M.J.: Nominal rewriting with name generation: abstraction vs. locality. In: Proc. 7th Int. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP 2005), pp. 47\u201358. ACM, New York (2005)"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M. Newman","year":"1942","unstructured":"Newman, M.: On theories with a combinatorial definition of equivalence. Annals of Mathematics\u00a043(2), 223\u2013243 (1942)","journal-title":"Annals of Mathematics"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/BFb0039068","volume-title":"CONCUR \u201990","author":"J.F. Groote","year":"1990","unstructured":"Groote, J.F.: A new strategy for proving omega-completeness applied to process algebra. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 314\u2013331. Springer, Heidelberg (1990)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/174675.174707","volume-title":"POPL 1994: Proc. 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"P. Lescanne","year":"1994","unstructured":"Lescanne, P.: From lambda-sigma to lambda-upsilon a journey through calculi of explicit substitutions. In: POPL 1994: Proc. 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 60\u201369. ACM Press, New York (1994)"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF00248324","volume":"5","author":"L.C. Paulson","year":"1989","unstructured":"Paulson, L.C.: The foundation of a generic theorem prover. Journal of Automated Reasoning\u00a05(3), 363\u2013397 (1989)","journal-title":"Journal of Automated Reasoning"},{"key":"14_CR15","first-page":"433","volume":"338","author":"M. Crabb\u00e9","year":"2004","unstructured":"Crabb\u00e9, M.: Une axiomatisation de la substitution. Comptes rendus de l\u2019Acad\u00e9mie des Sciences de Paris, S\u00e9rie I\u00a0338, 433\u2013436 (2004)","journal-title":"Comptes rendus de l\u2019Acad\u00e9mie des Sciences de Paris, S\u00e9rie I"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1093\/jigpal\/12.2.111","volume":"12","author":"M. Crabb\u00e9","year":"2004","unstructured":"Crabb\u00e9, M.: On the notion of substitution. Logic Journal of the IGPL\u00a012(2), 111\u2013124 (2004)","journal-title":"Logic Journal of the IGPL"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"481","DOI":"10.2307\/2273585","volume":"47","author":"N. Feldman","year":"1982","unstructured":"Feldman, N.: Axiomatization of polynomial substitution algebras. Journal of Symbolic Logic\u00a047(3), 481\u2013492 (1982)","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1093\/logcom\/14.3.373","volume":"14","author":"S. Lusin","year":"2004","unstructured":"Lusin, S., Salibra, A.: The lattice of lambda theories. Journal of Logic and Computation\u00a014(3), 373\u2013394 (2004)","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0304-3975(00)00059-1","volume":"249","author":"A. Salibra","year":"2000","unstructured":"Salibra, A.: On the algebraic models of lambda calculus. Theoretical Computer Science\u00a0249(1), 197\u2013240 (2000)","journal-title":"Theoretical Computer Science"},{"key":"14_CR20","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus: its Syntax and Semantics (revised edn.)","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus: its Syntax and Semantics (revised edn.). Studies in Logic and the Foundations of Mathematics, vol.\u00a0103. North-Holland, Amsterdam (1984)"},{"key":"14_CR21","unstructured":"Bloo, R.: Preservation of Termination for Explicit Substitution. PhD thesis, Eindhoven University of Technology, Eindhoven (1997)"},{"issue":"34","key":"14_CR22","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"5","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\u00a05(34), 381\u2013392 (1972)","journal-title":"Indagationes Mathematicae"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0038698","volume":"475","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. Extensions of Logic Programming\u00a0475, 253\u2013281 (1991)","journal-title":"Extensions of Logic Programming"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-45685-6_2","volume-title":"Theorem Proving in Higher Order Logics","author":"G. Huet","year":"2002","unstructured":"Huet, G.: Higher order unification 30 years later (Extended abstract). In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol.\u00a02410, pp. 3\u201312. Springer, Heidelberg (2002)"},{"key":"14_CR25","volume-title":"Proc. 7th Int. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP 2005)","author":"M.J. Gabbay","year":"2005","unstructured":"Gabbay, M.J.: A new calculus of contexts. In: Proc. 7th Int. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP 2005). ACM, New York (2005)"},{"key":"14_CR26","unstructured":"Gabbay, M.J.: Hierarchical nominal rewriting. In: LFMTP 2006, pp. 32\u201347 (2006)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11921240_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:44:17Z","timestamp":1619509457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11921240_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488156","9783540488163"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11921240_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}