{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:15:14Z","timestamp":1725560114724},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221746"},{"type":"electronic","value":"9783540259381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25938-1_14","type":"book-chapter","created":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T12:45:52Z","timestamp":1280061952000},"page":"160-175","source":"Crossref","is-referenced-by-count":1,"title":["Linearization by Program Transformation"],"prefix":"10.1007","author":[{"given":"Sandra","family":"Alves","sequence":"first","affiliation":[]},{"given":"M\u00e1rio","family":"Florido","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Alves, S., Florido, M.: On the relation between rank 2 intersection types and simple types. In: Joint Conference on Declarative Programming (AGP 2002) (2002)"},{"key":"14_CR2","unstructured":"Alves, S., Florido, M.: Linearization by program transformation. Technical report, DCC-FC, LIACC, University of Porto (2003), available from www.dcc.fc.up.pt\/~sandra\/papers\/report2003.ps"},{"key":"14_CR3","unstructured":"Asperti, A., Danos, V., Laneve, C., Regnier, L.: Paths in the lambda-calculus. Logic in Computer Science, 426\u2013436 (1994)"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(94)00279-7","volume":"142","author":"A. Asperti","year":"1995","unstructured":"Asperti, A., Laneve, C.: Paths, computations and labels in the lambdacalculus. Theoretical Computer Science\u00a0142(2), 277\u2013297 (1995)","journal-title":"Theoretical Computer Science"},{"key":"14_CR5","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus. Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus. Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol.\u00a0103. North-Holland, Amsterdam (1984)"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.2307\/421013","volume":"3","author":"H. Barendregt","year":"1997","unstructured":"Barendregt, H.: The impact of the lambda calculus. Bulletin of Symbolic Logic\u00a03(2), 181\u2013215 (1997)","journal-title":"Bulletin of Symbolic Logic"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M. Coppo","year":"1980","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: An extension of the basic functionality theory for the \u03bb-calculus. Notre Dame Journal of Formal Logic\u00a021(4), 685\u2013693 (1980)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Florido, M., Damas, L.: Linearization of the lambda-calculus and its relation with intersection type systems. To appear in Journal of Functional Programming (2004)","DOI":"10.1017\/S0956796803004970"},{"key":"14_CR9","first-page":"29","volume":"146","author":"J.R. Hindley","year":"1969","unstructured":"Hindley, J.R.: The principal type-scheme of an object in combinatory logic. Trans. American Math. Soc.\u00a0146, 29\u201360 (1969)","journal-title":"Trans. American Math. Soc."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(89)90100-X","volume":"64","author":"J.R. Hindley","year":"1989","unstructured":"Hindley, J.R.: BCK-Combinators and linear lambda-terms have types. Theoretical Computer Science\u00a064(1), 97\u2013105 (1989)","journal-title":"Theoretical Computer Science"},{"key":"14_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608865","volume-title":"Basic Simple Type Theory","author":"J.R. Hindley","year":"1997","unstructured":"Hindley, J.R.: Basic Simple Type Theory. Cambridge University Press, Cambridge (1997)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Kfoury, A.J.: A linearization of the lambda-calculus. Journal of Logic and Computation 10(3) (2000)","DOI":"10.1093\/logcom\/10.3.411"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Kfoury, A.J., Mairson, H.G., Turbak, F.A., Wells, J.B.: Relating typability and expressiveness in finite-rank intersection type systems. In: International Conference on Functional Programming, pp. 90\u2013101 (1999)","DOI":"10.1145\/317765.317788"},{"key":"14_CR14","unstructured":"L\u00e9vy, J.J.: R\u00e9ductions correctes et optimales dans le lambda calcul. PhD thesis, Universit\u00e9 Paris VII (1978)"},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. Assoc. for Computing Machinery\u00a012, 23\u201341 (1965)","journal-title":"J. Assoc. for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25938-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:53Z","timestamp":1605761933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25938-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221746","9783540259381"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25938-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}