{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:49:59Z","timestamp":1725562199492},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_30","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:06:41Z","timestamp":1280747201000},"page":"423-437","source":"Crossref","is-referenced-by-count":13,"title":["Strong Normalization of $\\overline{\\lambda}\\mu\\widetilde{\\mu}$ -Calculus with Explicit Substitutions"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Polonovski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Cardelli, L., Curien, P.-L., L\u00e9vy, J.-J.: Explicit Substitutions. Journal of Functional Programming (1991)","DOI":"10.1017\/S0956796800000186"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/3-540-57887-0_112","volume-title":"Theoretical Aspects of Computer Software","author":"F. Barbanera","year":"1994","unstructured":"Barbanera, F., Berardi, S.: A symmetric lambda-calculus for classical program extraction. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 495\u2013515. Springer, Heidelberg (1994)"},{"key":"30_CR3","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. Journal of Functional Programming (1996)","DOI":"10.1017\/S0956796800001945"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0304-3975(97)00183-7","volume":"211","author":"R. Bloo","year":"1999","unstructured":"Bloo, R., Geuvers, H.: Explicit Substitution: on the Edge of Strong Normalisation. Theoretical Computer Science\u00a0211, 375\u2013395 (1999)","journal-title":"Theoretical Computer Science"},{"key":"30_CR5","unstructured":"Bonelli, E.: Substitutions explicites et r\u00e9\u00e9criture de termes. PhD thesis, Universit\u00e9 Paris XI Orsay (2001)"},{"key":"30_CR6","volume-title":"The Calculi of Lambda Conversion","author":"A. Church","year":"1941","unstructured":"Church, A.: The Calculi of Lambda Conversion. Princeton Univ. Press, Princeton (1941)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/351240.351262","volume-title":"Proceedings of ICFP 2000","author":"P.-L. Curien","year":"2000","unstructured":"Curien, P.-L., Herbelin, H.: The duality of computation. In: Proceedings of ICFP 2000, pp. 233\u2013243. ACM Press, New York (2000)"},{"key":"30_CR8","unstructured":"Guillaume, B.: Un calcul de substitution avec \u00e9tiquettes. PhD thesis, Universit\u00e9 de Savoie (1999)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1093\/logcom\/11.3.431","volume":"11","author":"H. Herbelin","year":"2001","unstructured":"Herbelin, H.: Explicit substitutions and reducibility. Journal of Logic and Computation\u00a011, 429\u2013449 (2001)","journal-title":"Journal of Logic and Computation"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/BFb0014062","volume-title":"Typed Lambda Calculi and Applications","author":"P.-A. Mellies","year":"1995","unstructured":"Mellies, P.-A.: Typed \u03bb-calculi with explicit substitutions not terminate. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 328\u2013334. Springer, Heidelberg (1995)"},{"key":"30_CR11","unstructured":"Parigot, M.: \u03bb\u03bc-calculus: An algorithmic interpretation of classical natural deduction. In: Proceedings of LICS 1993, pp. 39\u201346. Computer Society Press (1993)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T13:21:02Z","timestamp":1552828862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}