{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:38:14Z","timestamp":1649104694507},"reference-count":48,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0304-3975(98)00166-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:38:29Z","timestamp":1027651109000},"page":"183-220","source":"Crossref","is-referenced-by-count":12,"title":["Confluence of extensional and non-extensional \u03bb-calculi with explicit substitutions"],"prefix":"10.1016","volume":"238","author":[{"given":"Delia","family":"Kesner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(98)00166-2_BIB1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitutions","volume":"4","author":"Abadi","year":"1991","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB2","doi-asserted-by":"crossref","unstructured":"Y. Akama, On Mints\u2019 reductions for ccc-Calculus, in: Proc. Int. Conf. on Typed Lambda Calculi and Applications (TLCA), Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993.","DOI":"10.1007\/BFb0037094"},{"issue":"5","key":"10.1016\/S0304-3975(98)00166-2_BIB3","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1017\/S0956796800001945","article-title":"\u03bb\u03c5, a calculus of explicit substitutions which preserves strong normalisation","volume":"6","author":"Benaissa","year":"1996","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB4","article-title":"Combinatory reduction systems with explicit substitution that preserve strong normalisation","volume":"vol. 1103","author":"Bloo","year":"1996"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB5","article-title":"An explicit eta rewrite rule","volume":"vol. 902","author":"Briaud","year":"1995"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB6","unstructured":"P.-L. Curien, Combinateurs Cat\u00e9goriques, algorithmes s\u00e9quentiels et programmation applicative, Th\u00e8se d'etat, Universit\u00e9 Paris VII, 1983."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB7","doi-asserted-by":"crossref","unstructured":"P.-L. Curien, Categorical combinators, sequential algorithms and functional programming, Progress in Theoretical Computer Science, 1st ed., Birkha\u00fcser, Basel, 1986.","DOI":"10.1007\/978-1-4612-0317-9_1"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB8","doi-asserted-by":"crossref","unstructured":"P.-L. Curien, R. Di Cosmo, A confluent reduction system for the \u03bb-calculus with surjective pairing and terminal object, in: Leach, Monien, Artalejo (Eds.), Internat. Conf. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 510, Springer, Berlin, 1991, pp. 291\u2013302.","DOI":"10.1007\/3-540-54233-7_142"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB9","unstructured":"P.-L. Curien, T. Hardin, J.-J. L\u00e9vy, Confluence Properties of Weak and Strong Calculi of Explicit substitutions, Technical Report 1617, INRIA-Rocquencourt, 1992."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB10","doi-asserted-by":"crossref","unstructured":"P.-L. Curien, T. Hardin, A. R\u0131\u0301os, Strong normalisation of Substitutions, MFCS\u201992, Lecture Notes in Computer Science, vol. 629, Springer, Berlin, 1992, pp. 209\u2013218.","DOI":"10.1007\/3-540-55808-X_19"},{"issue":"35","key":"10.1016\/S0304-3975(98)00166-2_BIB11","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","article-title":"Lambda-Calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem","volume":"5","author":"de Bruijn","year":"1972","journal-title":"Indag. Mat."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB12","first-page":"356","article-title":"Lambda-Calculus notation with namefree formulas involving symbols that represent reference transforming mappings","volume":"40","author":"de Bruijn","year":"1978","journal-title":"Indag. Mat."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB13","article-title":"A confluent reduction for the extensional typed \u03bb-calculus with pairs, sums, recursion and terminal object","volume":"vol. 700","author":"Di Cosmo","year":"1993"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB14","doi-asserted-by":"crossref","unstructured":"R. Di Cosmo, D. Kesner, Combining first order algebraic rewriting systems, recursion and extensional typed lambda calculi, Internat Conf. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 820, Springer, Berlin, 1994.","DOI":"10.1007\/3-540-58201-0_90"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB15","article-title":"Rewriting with Extensional Polymorphic \u03bb-Calculus (Extended Abstract)","volume":"vol. 1092","author":"Di Cosmo","year":"1995"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB16","doi-asserted-by":"crossref","unstructured":"D. Dougherty, Some lambda calculi with categorical sums and products, Proc. 5th Int. Conf. on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, vol. 690, Springer, Berlin, 1993.","DOI":"10.1007\/3-540-56868-9_12"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB17","doi-asserted-by":"crossref","unstructured":"G. Dowek, T. Hardin, C. Kirchner, Higher-Order Unification via explicit substitutions, Proc. Symp. on Logic in Computer Science (LICS), 1995.","DOI":"10.1109\/LICS.1995.523271"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB18","unstructured":"T. Ehrhard, Une s\u00e9mantique cat\u00e9gorique des types d\u00e9pendants. Application au calcul des constructions, Th\u00e8se de doctorat, Universit\u00e9 de Paris VII, 1988."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB19","first-page":"284","article-title":"\u03bb-Calculi with Explicit Substitutions and Composition which preserve \u03b2-Strong Normalization (Extended abstract)","volume":"vol. 1139","author":"Ferreira","year":"1996"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB20","unstructured":"T. Hardin, 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":"10.1016\/S0304-3975(98)00166-2_BIB21","doi-asserted-by":"crossref","unstructured":"T. Hardin, \u03b7-reduction for explicit substitutions, Algebraic and Logic Programming\u201992, Lecture Notes in Computer Science, vol. 632, Springer, Berlin, 1992.","DOI":"10.1007\/BFb0013834"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB22","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01188746","article-title":"Eta-conversion for the languages of explicit substitutions","volume":"5","author":"Hardin","year":"1994","journal-title":"Applicable Alg. Eng. Commun. Comput."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB23","doi-asserted-by":"crossref","unstructured":"T. Hardin, A. Laville, Proof of termination of the rewriting system subst on c.c.l., Theoret. Comput. Sci., 1986.","DOI":"10.1016\/0304-3975(86)90035-6"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB24","unstructured":"T. Hardin, J.-J. L\u00e9vy, A confluent calculus of substitutions, France\u2013Japan Artificial Intelligence and Computer Science Symp., 1989."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB25","doi-asserted-by":"crossref","unstructured":"T. Hardin, L. Maranget, B. Pagano, Functional back-ends and compilers within the lambda-sigma calculus, 1995, Draft.","DOI":"10.1145\/232627.232632"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB26","unstructured":"G. Huet, R\u00e9solution d\u2019\u00e9quations dans les langages d'ordre 1,2,\u2026,\u03c9, Th\u00e8se de Doctorat d\u2019\u00e9tat, Universit\u00e9 Paris VII, 1976."},{"issue":"2","key":"10.1016\/S0304-3975(98)00166-2_BIB27","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1017\/S0956796800001301","article-title":"The Virtues of Eta-expansion","volume":"5","author":"Jay","year":"1995","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB28","doi-asserted-by":"crossref","unstructured":"F. Kamareddine, A. R\u0131\u0301os, A \u03bb-calculus \u00e0 la de Bruijn with explicit substitutions, Proc. Int. Symp. on Programming Language Implementation and Logic Programming, Lecture Notes in Computer Science, vol. 982, Springer, Berlin, 1995.","DOI":"10.1007\/BFb0026813"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB29","first-page":"184","article-title":"Confluence properties of extensional and non-extensional \u03bb-calculi with explicit substitutions","volume":"vol. 1103","author":"Kesner","year":"1996"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB30","doi-asserted-by":"crossref","unstructured":"D. Kesner, Confluence of extensional and non-extensional \u03bb-calculi with explicit substitutions, Technical Report 1103, LRI, Universit\u00e9 Paris-Sud, 1997.","DOI":"10.1007\/3-540-61464-8_52"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB31","unstructured":"D. Kesner, Reasoning about redundant patterns, J. Funct. Logic Programming, 1997, to appear."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB32","unstructured":"J.W. Klop, Combinatory Reduction Systems, Mathematical Centre Tracts, vol. 127, CWI, Amsterdam, 1980, Ph.D. Thesis."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB33","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","article-title":"Combinatory reduction systems: introduction and survey","volume":"121","author":"Klop","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB34","doi-asserted-by":"crossref","unstructured":"P. Lescanne, From \u03bb\u03c3 to \u03bbv, a journey through calculi of explicit substitutions, in: Ann. ACM Symp. on Principles of Programming Languages (POPL), ACM, 1994, pp. 60\u201369.","DOI":"10.1145\/174675.174707"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB35","unstructured":"P. Lescanne, Personal Communication, 1996."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB36","unstructured":"P. Lescanne, J. Rouyer-Degli, The calculus of explicit substitutions \u03bb\u03bd, Technical Report, INRIA, Lorraine, 1994."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB37","unstructured":"M. Mauny, Compilation des langages fonctionnels dans les combinateurs cat\u00e9goriques. Applications au langage ML, Th\u00e8se 3em\u0300e cycle, Universit\u00e9 Paris VII, 1985."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB38","doi-asserted-by":"crossref","unstructured":"P.-A. Mellies, Four typed-lambda calculi with explicit substitutions may not terminate: the first examples, 1994, Draft.","DOI":"10.1007\/BFb0014062"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB39","article-title":"Typed \u03bb-calculi with explicit substitutions may not terminate","volume":"vol. 902","author":"Mellies","year":"1995"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB40","first-page":"83","article-title":"Closed categories and the theory of proofs","volume":"68","author":"Mints","year":"1977","journal-title":"Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V.A. Steklova AN SSSR"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB41","unstructured":"G. Mints, Teorija categorii i teoria dokazatelstv.I, Aktualnye problemy logiki i metodologii nauky, 1979, pp. 252\u2013278."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB42","article-title":"A left-linear variant of \u03bb\u03c3","volume":"vol. 1298","author":"Mu\u00f1oz","year":"1997"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB43","unstructured":"B. Pagano, Des calculs de substitution explicite et de leur application \u00e0 la compilation des langages fonctionnels, Th\u00e8se de doctorat, Universit\u00e9 Pierre et Marie Curie, 1998."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB44","doi-asserted-by":"crossref","unstructured":"G. Pottinger, The Church Rosser theorem for the typed lambda-calculus with Surjective pairing, Notre Dame J. Formal Logic 22 (3) (1981) pp. 264\u2013268.","DOI":"10.1305\/ndjfl\/1093883461"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB45","doi-asserted-by":"crossref","unstructured":"D. Prawitz, Ideas and results in proof theory, Proc. 2nd Scandinavian Logic Symp., 1971, pp. 235\u2013307.","DOI":"10.1016\/S0049-237X(08)70849-8"},{"key":"10.1016\/S0304-3975(98)00166-2_BIB46","unstructured":"A. R\u0131\u0301os, Contribution \u00e0 l\u2019\u00e9tude des \u03bb-calculus avec substitutions explicites, Th\u00e8se de doctorat, Universit\u00e9 de Paris VII, 1993."},{"key":"10.1016\/S0304-3975(98)00166-2_BIB47","doi-asserted-by":"crossref","unstructured":"V. van Oostrom, F. van Raamsdonk, Weak orthogonality implies confluence: the higher-order case, Proc. 3rd Internat. Symp. on Logical Foundations of Computer Science, 1994, pp. 379\u2013392.","DOI":"10.1007\/3-540-58140-5_35"},{"issue":"17","key":"10.1016\/S0304-3975(98)00166-2_BIB48","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1006\/jsco.1994.1003","article-title":"Termination on term rewriting: interpretation and type elimination","volume":"1","author":"Zantema","year":"1994","journal-title":"J. Symbolic Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001662?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001662?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:09:13Z","timestamp":1580875753000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":48,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397598001662"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00166-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}