{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:54Z","timestamp":1759638594086},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_20","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T01:13:35Z","timestamp":1187918015000},"page":"238-252","source":"Crossref","is-referenced-by-count":18,"title":["The Theory of Calculi with Explicit Substitutions Revisited"],"prefix":"10.1007","author":[{"given":"Delia","family":"Kesner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Arbiser, A., Bonelli, E., R\u00edos, A.: Perpetuality in a lambda calculus with explicit substitutions and composition. In: WAIT (2000)"},{"issue":"1","key":"20_CR2","first-page":"375","volume":"4","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Cardelli, L., Curien, P.L., L\u00e9vy, J.-J.: Explicit substitutions. JFP\u00a04(1), 375\u2013416 (1991)","journal-title":"JFP"},{"key":"20_CR3","unstructured":"Arbiser, A.: Explicit Substitution Systems and Subsystems. PhD thesis, Universidad Buenos Aires (2006)"},{"key":"20_CR4","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam (1984)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Barendregt, H.: Lambda calculus with types. Handbook of Logic in Computer Science\u00a02 (1992)","DOI":"10.1017\/S0956796800000447"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Benaissa, Z.-E.-A., Briaud, D., Lescanne, P., Rouyer-Degli, J.: \u03bb\u03c5, a calculus of explicit substitutions which preserves strong normalisation. JFP\u00a0 (1996)","DOI":"10.1017\/S0956796800001945"},{"issue":"5","key":"20_CR7","first-page":"699","volume":"6","author":"R. Bloo","year":"1999","unstructured":"Bloo, R., Geuvers, H.: Explicit substitution: on the edge of strong normalization. TCS\u00a06(5), 699\u2013722 (1999)","journal-title":"TCS"},{"key":"20_CR8","unstructured":"Bloo, R.: Preservation of Termination for Explicit Substitution. PhD thesis, Eindhoven University of Technology (1997)"},{"key":"20_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"20_CR10","unstructured":"Bloo, R., Rose, K.: Preservation of strong normalization in named lambda calculi with explicit substitution and garbage collection. In: Computer Science in the Netherlands (1995)"},{"issue":"35","key":"20_CR11","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"5","author":"N. Bruijn de","year":"1972","unstructured":"de Bruijn, N.: Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem. Indag. Mat.\u00a05(35), 381\u2013392 (1972)","journal-title":"Indag. Mat."},{"key":"20_CR12","first-page":"356","volume":"40","author":"N. Bruijn de","year":"1978","unstructured":"de Bruijn, N.: Lambda-calculus notation with namefree formulas involving symbols that represent reference transforming mappings. Indag. Mat.\u00a040, 356\u2013384 (1978)","journal-title":"Indag. Mat."},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46432-8_5","volume-title":"Foundation of Software Science and Computation Structures","author":"R. Cosmo Di","year":"2000","unstructured":"Di Cosmo, R., Kesner, D., Polonovski, E.: Proof nets and explicit substitutions. In: Tiuryn, J. (ed.) ETAPS 2000 and FOSSACS 2000. LNCS, vol.\u00a01784, Springer, Heidelberg (2000)"},{"key":"20_CR14","first-page":"169","volume":"11","author":"R. David","year":"2001","unstructured":"David, R., Guillaume, B.: A \u03bb-calculus with explicit weakening and explicit substitution. MSCS\u00a011, 169\u2013206 (2001)","journal-title":"MSCS"},{"key":"20_CR15","first-page":"183","volume":"157","author":"G. Dowek","year":"2000","unstructured":"Dowek, G., Hardin, T., Kirchner, C.: Higher-order unification via explicit substitutions. I&C\u00a0157, 183\u2013235 (2000)","journal-title":"I&C"},{"key":"20_CR16","unstructured":"Dyckhoff, R., Urban, C.: Strong normalisation of Herbelin\u2019s explicit substitution calculus with substitution propagation. In: WESTAPP 2001 (2001)"},{"key":"20_CR17","unstructured":"de Flavio Moura, M.A.-R., Kamareddine, F.: Higher order unification: A structural relation between Huet\u2019s method and the one based on explicit substitution. Available from http:\/\/www.macs.hw.ac.uk\/~fairouz\/papers\/"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45610-4_13","volume-title":"Rewriting Techniques and Applications","author":"J. Forest","year":"2002","unstructured":"Forest, J.: A weak calculus with explicit operators for pattern matching and substitution. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, Springer, Heidelberg (2002)"},{"issue":"1","key":"20_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. TCS\u00a050(1), 1\u2013101 (1987)","journal-title":"TCS"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48167-2_8","volume-title":"Types for Proofs and Programs","author":"J. Goubault-Larrecq","year":"1999","unstructured":"Goubault-Larrecq, J.: Conjunctive types and SKInT. In: Altenkirch, T., Naraschewski, W., Reus, B. (eds.) TYPES 1998. LNCS, vol.\u00a01657, Springer, Heidelberg (1999)"},{"key":"20_CR21","unstructured":"Hardin, T.: R\u00e9sultats de confluence pour les r\u00e8gles fortes de la logique combinatoire cat\u00e9gorique et liens avec les lambda-calculs. Th\u00e8se de doctorat, Universit\u00e9 de Paris VII (1987)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022247","volume-title":"Computer Science Logic","author":"H. Herbelin","year":"1995","unstructured":"Herbelin, H.: A \u0142-calculus structure isomorphic to sequent calculus structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, Springer, Heidelberg (1995)"},{"key":"20_CR23","unstructured":"Hardin, T., L\u00e9vy, J.-J.: A confluent calculus of substitutions. In: France-Japan Artificial Intelligence and Computer Science Symposium (1989)"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Hardin, T., Maranget, L., Pagano, B.: Functional back-ends within the lambda-sigma calculus. In: ICFP (1996)","DOI":"10.1145\/232627.232632"},{"key":"20_CR25","unstructured":"Huet, G.: R\u00e9solution d\u2019\u00e9quations dans les langages d\u2019ordre 1,2, ..., \u03c9. Th\u00e8se de doctorat d\u2019\u00e9tat, Universit\u00e9 Paris VII (1976)"},{"key":"20_CR26","unstructured":"Khasidashvili, Z.: Expression reduction systems. In: Proceedings of IN Vekua Institute of Applied Mathematics, Tbilisi, vol.\u00a036 (1990)"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"D. Kesner","year":"1996","unstructured":"Kesner, D.: Confluence properties of extensional and non-extensional \u03bb-calculi with explicit substitutions. In: Ganzinger, H. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a01103, Springer, Heidelberg (1996)"},{"key":"20_CR28","unstructured":"Kesner, D.: The theory of calculi with explicit substitutions revisited (2006), Available as http:\/\/hal.archives-ouvertes.fr\/hal-00111285\/"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","volume-title":"Term Rewriting and Applications","author":"D. Kesner","year":"2005","unstructured":"Kesner, D., Lengrand, S.: Extending the explicit substitution paradigm. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, Springer, Heidelberg (2005)"},{"key":"20_CR30","unstructured":"Klop, J.-W.: Combinatory Reduction Systems. PhD thesis, Mathematical Centre Tracts 127, CWI, Amsterdam (1980)"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45127-7_11","volume-title":"Rewriting Techniques and Applications","author":"Z. Khasidashvili","year":"2001","unstructured":"Khasidashvili, Z., Ogawa, M., van Oostrom, V.: Uniform Normalization Beyond Orthogonality. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, Springer, Heidelberg (2001)"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026813","volume-title":"Programming Languages: Implementations, Logics and Programs","author":"F. Kamareddine","year":"1995","unstructured":"Kamareddine, F.: A \u03bb-calculus \u00e0 la de Bruijn with explicit substitutions. In: Swierstra, S.D. (ed.) PLILP 1995. LNCS, vol.\u00a0982, Springer, Heidelberg (1995)"},{"key":"20_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_29","volume-title":"Computer Science Logic","author":"S. Lengrand","year":"2006","unstructured":"Lengrand, S., Dyckhoff, R., McKinna, J.: A sequent calculus for type theory. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, Springer, Heidelberg (2006)"},{"key":"20_CR34","unstructured":"Lengrand, S.: Normalisation and Equivalence in Proof Theory and Type Theory. PhD thesis, University Paris 7 and University of St Andrews (2006)"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Lescanne, P.: From \u03bb \u03c3 to \u03bb \u03c5 , a journey through calculi of explicit substitutions. In: POPL (1994)","DOI":"10.1145\/174675.174707"},{"key":"20_CR36","series-title":"Lecture Notes in Computer Science","volume-title":"8th International Conference on Automated Deduction","author":"R. Lins","year":"1986","unstructured":"Lins, R.: A new formula for the execution of categorical combinators. In: Siekmann, J.H. (ed.) 8th International Conference on Automated Deduction. LNCS, vol.\u00a0230, Springer, Heidelberg (1986)"},{"key":"20_CR37","unstructured":"Lins, R.: Partial categorical multi-combinators and Church Rosser theorems. Technical Report 7\/92, Computing Laboratory, University of Kent at Canterbury (1992)"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"J.-J. L\u00e9vy","year":"1999","unstructured":"L\u00e9vy, J.-J., Maranget, L.: Explicit substitutions and programming languages. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol.\u00a01738, Springer, Heidelberg (1999)"},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"P. Lescanne","year":"1995","unstructured":"Lescanne, P., Rouyer-Degli, J.: Explicit substitutions with de Bruijn levels. In: Hsiang, J. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a0914, Springer, Heidelberg (1995)"},{"key":"20_CR40","series-title":"Lecture Notes in Computer Science","volume-title":"Typed Lambda Calculi and Applications","author":"P.-A. Melli\u00e8s","year":"1995","unstructured":"Melli\u00e8s, P.-A.: Typed \u03bb-calculi with explicit substitutions may not terminate. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, Springer, Heidelberg (1995)"},{"key":"20_CR41","unstructured":"Mu\u00f1oz, C.: Un calcul de substitutions pour la repr\u00e9sentation de preuves partielles en th\u00e9orie de types. PhD thesis, Universit\u00e9 Paris 7 (1997)"},{"key":"20_CR42","unstructured":"Nederpelt, R.: Strong Normalization in a Typed Lambda Calculus with Lambda Structured Types. PhD thesis, Eindhoven University of Technology (1973)"},{"key":"20_CR43","unstructured":"Polonovski, E.: Substitutions explicites, logique et normalisation. Th\u00e8se de doctorat, Universit\u00e9 Paris 7 (2004)"},{"key":"20_CR44","series-title":"Lecture Notes in Computer Science","volume-title":"Conditional Term Rewriting Systems","author":"K. Rose","year":"1993","unstructured":"Rose, K.: Explicit cyclic substitutions. In: Rusinowitch, M., Remy, J.-L. (eds.) Conditional Term Rewriting Systems. LNCS, vol.\u00a0656, Springer, Heidelberg (1993)"},{"key":"20_CR45","unstructured":"Sakurai, T.: Strong normalizability of calculus of explicit substitutions with composition. Available on http:\/\/www.math.s.chiba-u.ac.jp\/~sakurai\/papers.html"},{"key":"20_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44881-0_5","volume-title":"Rewriting Techniques and Applications","author":"F.-R. Sinot","year":"2003","unstructured":"Sinot, F.-R., Fern\u00e1ndez, M., Mackie, I.: Efficient reductions with director strings. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, Springer, Heidelberg (2003)"},{"key":"20_CR47","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese.: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T18:26:59Z","timestamp":1684002419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}