{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:37Z","timestamp":1749124057258},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590484"},{"type":"electronic","value":"9783540491781"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0014047","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:50:31Z","timestamp":1132732231000},"page":"94-108","source":"Crossref","is-referenced-by-count":6,"title":["An explicit Eta rewrite rule"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Briaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","volume":"1","author":"M. Abadi","year":"1991","unstructured":"M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L\u00e9vy. Explicit substitutions. Journal of Functional Programming, 1(4):375\u2013416, 1991.","journal-title":"Journal of Functional Programming"},{"key":"7_CR2","volume-title":"Studies in Logic and the Foundation of Mathematics","author":"H. P. Barendregt","year":"1984","unstructured":"H. P. Barendregt. The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, 1984. Second edition.","edition":"Second edition"},{"key":"7_CR3","unstructured":"Z. Benaissa, D. Briaud, P. Lescanne, and J. Rouyer-Degli. \u03bb\u03c5, a calculus of explicit substitutions which preserves strong normalisation. Submitted, December 1994."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"D. Briaud. An explicit Eta rewrite rule. Rapport de Recherche 2417, INRIA, 1994.","DOI":"10.1007\/BFb0014047"},{"key":"7_CR5","volume-title":"Combinatory Logic, volume 1","author":"H. B. Curry","year":"1958","unstructured":"H. B. Curry and Feys. Combinatory Logic, volume 1. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, 1958."},{"key":"7_CR6","unstructured":"P.-L. Curien. Combinateurs cat\u00e9goriques, algorithmes s\u00e9quentiels et programmation applicative. Th\u00e9se de Doctorat d'Etat, Univ. Paris 7, 1983."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0019-9958(86)80047-X","volume":"69","author":"P.-L. Curien","year":"1986","unstructured":"P.-L. Curien. Categorical combinators. Information and Control, 69:188\u2013254, 1986.","journal-title":"Information and Control"},{"key":"7_CR8","unstructured":"P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman, 1986."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N. G. Bruijn de","year":"1972","unstructured":"N. G. de Bruijn, Lambda calculus with nameless dummies, a tool for automatic formula manipulation. Indag. Mat., 34:381\u2013392, 1972.","journal-title":"Indag. Mat."},{"key":"7_CR10","volume-title":"TH-Repoft 78-WSK-03","author":"N. G. Bruijn de","year":"1978","unstructured":"N. G. de Bruijn. A namefree lambda calculus with facilities for internal definition of expressions and segments. TH-Repoft 78-WSK-03, Technological University Eindhoven, Netherlands, Department of Math., 1978."},{"key":"7_CR11","unstructured":"Th. Hardin. R\u00e9sultats de confluence pour les r\u00e9gies fortes de la logique combinatoire cat\u00e9gorique et liens avec les lambda-calculs. Th\u00e9se de Doctorat d'Etat, Univ. Paris 7, 1987."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(89)90105-9","volume":"65","author":"T. Hardin","year":"1989","unstructured":"Th. Hardin. Confluence results for the pure strong categorical combinatory logic CCL: \u03bb-calculi as subsystems of CCL. In TCS, 65:291\u2013342, 1989.","journal-title":"TCS"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Th. Hardin. Eta-conversion for the languages of explicit substitutions. In 3rd ALP, LNCS 632, Volterra, Italy, 1992.","DOI":"10.1007\/BFb0013834"},{"key":"7_CR14","unstructured":"Th. Hardin and J.-J. Levy. A confluent calculus of substitutions. In France-Japan Artificial Intelligence and Computer Science Symposium, Izu, 1989."},{"key":"7_CR15","unstructured":"J. Roger Hindley and Johnathan P. Seldin. Introduction to Combinators and Lambda-calculus. Cambridge University, 1986."},{"key":"7_CR16","first-page":"257","volume-title":"Computational Logic. Essays in honor of Alan Robinson, chapter 8","author":"J.-P. Jouannaud","year":"1991","unstructured":"J.-P. Jouannaud and Claude Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257\u2013321. The MIT press, Cambridge (MA, USA), 1991."},{"key":"7_CR17","first-page":"60","volume-title":"21st POPL","author":"P. Lescanne","year":"1994","unstructured":"P. Lescanne. From \u03bb\u03c3 to \u03bb\u03c5, a journey through calculi of explicit substitutions. In 21st POPL, Portland (Or., USA), pages 60\u201369. ACM, 1994."},{"key":"7_CR18","unstructured":"P. Lescanne and J. Rouyer-Degli. The calculus of explicit substitutions \u03bb\u03c5. Technical Report RR-2222, INRIA-Lorraine, January 1994."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"P. Lescanne and J. Rouyer-Degli. Explicit substitutions with de Bruijn's levels, August 1994.","DOI":"10.1007\/3-540-59200-8_65"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"P.-A. Melli\u00e9s. Typed \u03bb-calculi with explicit substitutions may not terminate. In M. Dezani, editor, TLCA, 1995.","DOI":"10.1007\/BFb0014062"},{"key":"7_CR21","unstructured":"A. Rios. Contributions \u00e1 l'\u00e9tude des \u03bb-calculs avec des substitutions explicites. Th\u00e9se de Doctorat d'Universit\u00e9, U. Paris VII, 1993."}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:37:58Z","timestamp":1586579878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590484","9783540491781"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0014047","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}