{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:51:39Z","timestamp":1649177499654},"reference-count":29,"publisher":"Elsevier BV","issue":"20","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T00:00:00Z","timestamp":1374451200000},"content-version":"vor","delay-in-days":843,"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":[[2011,4]]},"DOI":"10.1016\/j.tcs.2010.12.018","type":"journal-article","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T09:47:06Z","timestamp":1293011226000},"page":"1903-1915","source":"Crossref","is-referenced-by-count":2,"title":["Strong normalization from an unusual point of view"],"prefix":"10.1016","volume":"412","author":[{"given":"Luca","family":"Paolini","sequence":"first","affiliation":[]},{"given":"Elaine","family":"Pimentel","sequence":"additional","affiliation":[]},{"given":"Simona","family":"Ronchi Della Rocca","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2010.12.018_br000005","series-title":"Research Topics in Functional Programming","first-page":"65","article-title":"The lazy lambda-calculus","author":"Abramsky","year":"1990"},{"issue":"2","key":"10.1016\/j.tcs.2010.12.018_br000010","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","article-title":"Full abstraction in the lazy lambda calculus","volume":"105","author":"Abramsky","year":"1993","journal-title":"Information and Computation"},{"issue":"4","key":"10.1016\/j.tcs.2010.12.018_br000015","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"A filter lambda model and the completeness of type assignment","volume":"48","author":"Barendregt","year":"1983","journal-title":"The Journal of Symbolic Logic"},{"key":"10.1016\/j.tcs.2010.12.018_br000020","series-title":"The Lambda Calculus: Its Syntax and Semantics","volume":"vol. 103","author":"Barendregt","year":"1984"},{"key":"10.1016\/j.tcs.2010.12.018_br000025","series-title":"Programming Concepts and Methods (PROCOMET\u201998)","first-page":"30","article-title":"Structures for lazy semantics","author":"Bastonero","year":"1998"},{"key":"10.1016\/j.tcs.2010.12.018_br000030","unstructured":"Corrado B\u00f6hm, Alcune propriet\u00e0 delle forme \u03b2\u03b7-normali nel \u03bbK-calculus. Pubblicazione n. 696, Istituto per le Applicazioni del Calcolo, Roma, 1968."},{"issue":"2","key":"10.1016\/j.tcs.2010.12.018_br000035","first-page":"85","article-title":"Type theories, normal forms, and D\u221e-lambda-models","volume":"72","author":"Coppo","year":"1987","journal-title":"Information and Control"},{"key":"10.1016\/j.tcs.2010.12.018_br000040","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1090\/S0002-9947-1936-1501858-0","article-title":"Some properties of conversion","volume":"39","author":"Church","year":"1936","journal-title":"Transactions of the American Mathematical Society"},{"key":"10.1016\/j.tcs.2010.12.018_br000045","series-title":"The Calculi of Lambda Conversion","volume":"vol. 6","author":"Church","year":"1941"},{"issue":"4","key":"10.1016\/j.tcs.2010.12.018_br000050","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","article-title":"An extension of the basic functionality theory for the \u03bb-calculus","volume":"21","author":"Coppo","year":"1980","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"10.1016\/j.tcs.2010.12.018_br000055","series-title":"Logic and Computer Science","first-page":"123","article-title":"On Girard Candidats de Reducibilit\u00e9","author":"Gallier","year":"1990"},{"key":"10.1016\/j.tcs.2010.12.018_br000060","series-title":"Proceedings of 2nd Scandinavian Logic Symposium","first-page":"63","article-title":"Une extension de l\u2019interpretation de g\u00f6del \u00e0 l\u2019analyse, et son application \u00e0 l\u2019\u00e9limination des coupures dans l\u2019analyse et la th\u00e9orie des types","author":"Girard","year":"1971"},{"key":"10.1016\/j.tcs.2010.12.018_br000065","unstructured":"Jean-Yves Girard, Interpr\u00e9tation functionelle et \u00e9limination des coupures de l\u2019arithm\u00e9tique d\u2019ordre sup\u00e9rieur, Ph.D. Thesis, Universit\u00e9 de Paris VII, 1972."},{"issue":"12","key":"10.1016\/j.tcs.2010.12.018_br000070","first-page":"361","article-title":"A syntactic characterization of the equality in some models of the lambda calculus","volume":"2","author":"Martin","year":"1976","journal-title":"Journal of the London Mathematical Society"},{"key":"10.1016\/j.tcs.2010.12.018_br000075","series-title":"Lambda-Calculus, Types and Models","author":"Krivine","year":"1993"},{"key":"10.1016\/j.tcs.2010.12.018_br000080","unstructured":"R. Nederpelt, Strong normalisation in a lambda calculus with lambda structured types, Ph.D. Thesis, Eindhoven University of Technology, The Netherlands, 1973."},{"key":"10.1016\/j.tcs.2010.12.018_br000085","series-title":"Proceedings of the 29th Annual Symposium on Foundations of Computer Science, FOCS\u201988","first-page":"24","article-title":"Fully abstract models of the lazy lambda calculus","author":"Luke Ong","year":"1988"},{"key":"10.1016\/j.tcs.2010.12.018_br000090","unstructured":"Luca Paolini, La chiamata per Valore e La valutazione pigra nel \u03bb-calcolo, Tesi di laurea, Dipartimento di Informatica, Universit\u00e1 di Torino, 1998."},{"issue":"6","key":"10.1016\/j.tcs.2010.12.018_br000095","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1051\/ita:1999130","article-title":"Call-by-value solvability","volume":"33","author":"Paolini","year":"1999","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"10.1016\/j.tcs.2010.12.018_br000100","series-title":"Proceedings of the 7th Italian Conference in Theoretical Computer Science, ICTCS\u201901 (Torino, Italy, October 4\u20136, 2001)","first-page":"74","article-title":"Call-by-value separability and computability","volume":"vol. 2202","author":"Paolini","year":"2001"},{"key":"10.1016\/j.tcs.2010.12.018_br000105","series-title":"Proceedings of Intersection Types and Related Systems, ITRS\u201904, a Satellite Workshop of the Symposium on Logic in Computer Science, LICS\u201904","first-page":"103","article-title":"Lazy strong normalization","volume":"vol. 136C","author":"Paolini","year":"2004"},{"issue":"1","key":"10.1016\/j.tcs.2010.12.018_br000110","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ic.2003.08.003","article-title":"The parametric parameter passing \u03bb-calculus","volume":"189","author":"Paolini","year":"2004","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2010.12.018_br000115","series-title":"Proceedings of 9th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2006, Held as Part of the European Joint Conferences on Theory and Practice of Software 2006","first-page":"367","article-title":"An operational characterization of strong normalization","volume":"vol. 3921","author":"Paolini","year":"2006"},{"key":"10.1016\/j.tcs.2010.12.018_br000120","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value and the \u03bb-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2010.12.018_br000125","series-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"561","article-title":"A type assignment for the strongly normalizable \u03bb-terms","author":"Pottinger","year":"1980"},{"key":"10.1016\/j.tcs.2010.12.018_br000130","series-title":"The Parametric \u03bb-Calculus: A Metamodel for Computation","author":"Ronchi Della Rocca","year":"2004"},{"key":"10.1016\/j.tcs.2010.12.018_br000135","doi-asserted-by":"crossref","first-page":"198","DOI":"10.2307\/2271658","article-title":"Intensional interpretation of functionals of finite type","volume":"32","author":"Tait","year":"1967","journal-title":"The Journal of Symbolic Logic"},{"key":"10.1016\/j.tcs.2010.12.018_br000140","unstructured":"Pawel Urzyczyn, A simple proof of undecidability of strong normalization, Notes, 2000."},{"issue":"3","key":"10.1016\/j.tcs.2010.12.018_br000145","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott\u2019s D\u221e-models of the lambda-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM Journal of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397510007097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397510007097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T04:27:40Z","timestamp":1544070460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397510007097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":29,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["S0304397510007097"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2010.12.018","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}