{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T21:20:13Z","timestamp":1792099213534,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540186250","type":"print"},{"value":"9783540480334","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18625-5_65","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:40:54Z","timestamp":1330198854000},"page":"420-434","source":"Crossref","is-referenced-by-count":7,"title":["Program development using lambda abstraction"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Pettorossi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"29_CR1","unstructured":"Abdali, K.S. and Vytopil, J.: \"Generalization Heuristics for Theorems Related to Recursively Defined Functions\" Report Buro Voor Systeemontwikkeling. Postbus 8348, Utrecht, Netherlands (1984)."},{"key":"29_CR2","unstructured":"Aubin, R.: \"Mechanizing Structural Induction\" Ph.D. Thesis, Dept. of Artificial Intelligence, University of Edinburgh (1976)."},{"issue":"8","key":"29_CR3","first-page":"613","volume":"21","author":"J. Backus","year":"1978","unstructured":"Backus, J.: \"Can Programming be Liberated from the Von Neumann Style?\" Comm. A.C.M. 21(8) (1978), pp. 613\u2013641.","journal-title":"Comm. A.C.M."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00264249","volume":"21","author":"R. S. Bird","year":"1984","unstructured":"Bird, R.S.: \"Using Circular Programs to Eliminate Multiple Traversal of Data\" Acta Informatica 21 (1984), pp. 239\u2013250.","journal-title":"Acta Informatica"},{"key":"29_CR5","series-title":"Technical Monograph","volume-title":"An Introduction to the Theory of Lists","author":"R. S. Bird","year":"1986","unstructured":"Bird, R.S.: \"An Introduction to the Theory of Lists\" Technical Monograph PRG-56, Oxford University Computing Laboratory, Oxford, England (1986)."},{"issue":"1","key":"29_CR6","first-page":"129","volume":"22","author":"R. S. Boyer","year":"1975","unstructured":"Boyer, R.S. and Moore, J.S.: \"Proving Theorems About LISP Functions\" J.A.C.M. 22, 1 (1975), pp. 129\u2013144.","journal-title":"J.A.C.M."},{"issue":"1","key":"29_CR7","first-page":"44","volume":"24","author":"R. M. Burstall","year":"1977","unstructured":"Burstall, R.M. and Darlington, J.: \"A Transformation System for Developing Recursive Programs\" J.A.C.M. Vol.24, 1 (1977), pp. 44\u201367.","journal-title":"J.A.C.M."},{"issue":"1\u201327","key":"29_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01744285","volume":"13","author":"L. M. Chirica","year":"1979","unstructured":"Chirica, L.M. and Martin, D.F.: \"An Order-Algebraic Definition of Knuthian Semantics\" Mathematical System Theory 13, 1\u201327 (1979), pp. 1\u201327.","journal-title":"Mathematical System Theory"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(81)90014-X","volume":"16","author":"J. Darlington","year":"1981","unstructured":"Darlington, J.: \"An Experimental Program Transformation and Synthesis System\" Artificial Intelligence 16, (1981), pp. 1\u201346.","journal-title":"Artificial Intelligence"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0304-3975(82)90111-6","volume":"18","author":"A. P. Ershov","year":"1982","unstructured":"Ershov, A. P.: \"Mixed Computation: Potential Applications and Problems for Study\" Theoretical Computer Science Vol.18, (1982), pp. 41\u201367.","journal-title":"Theoretical Computer Science"},{"key":"29_CR11","unstructured":"Feather, M.S.: \"A Survey and Classification of Some Program Transformation Techniques\" Proc. TC2 IFIP Working Conference on Program Specification and Transformation. Bad T\u00f6lz, Germany (ed. L. Meertens) (1986)."},{"key":"29_CR12","unstructured":"J\u00f8rring, U. and Scherlis, W. L.: \"Compilers and Staging Transformations\" Thirteenth Annual A.C.M. Symposium on Principles of Programming Languages, St. Petersburgh Beach, Florida, USA (1986), pp. 86\u201396."},{"key":"29_CR13","volume-title":"Abstract Interpretations and Optimising Transformations for Applicative Programs","author":"A. Mycroft","year":"1981","unstructured":"Mycroft, A.: \"Abstract Interpretations and Optimising Transformations for Applicative Programs\" Ph.D. Thesis, Computer Science Department, University of Edinburgh, Scotland (1981)."},{"key":"29_CR14","unstructured":"Pettorossi, A.: \"Improving Memory Utilization in Transforming Recursive Programs\" Proc. MFCS 78, Zakopane (Poland), Lecture Notes in Computer Science n.64, Springer Verlag (1978), pp. 416\u2013425."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Pettorossi, A.: \"A Powerful Strategy for Deriving Efficient Programs by Transformation\" ACM Symposium on Lisp and Functional Programming, Austin, Texas (1984), pp.273\u2013281.","DOI":"10.1145\/800055.802044"},{"key":"29_CR16","unstructured":"Pettorossi, A. and A. Skowron: \"Higher Order Generalization in Program Derivation\" Proc. Intern. Joint Conference on Theory and Practice of Software Development. Pisa, Italy. Lecture Notes in Computer Science n. 250, Springer-Verlag (1987), pp. 182\u2013196."},{"key":"29_CR17","unstructured":"Scherlis, W. L.: \"Program Improvement by Internal Specialization\" A.C.M. Eighth Symposium on Principles of Programming Languages, (1981), pp. 146\u2013160."},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-15198-2_4","volume-title":"Mathematical Foundations of Software Development, TAPSOFT '85","author":"W. L. Scherlis","year":"1985","unstructured":"Scherlis, W. L., and Scott, D.: \"Semantical Based Programming Tools\" Mathematical Foundations of Software Development, TAPSOFT '85, Lecture Notes in Computer Science n. 185, Springer-Verlag, Berlin (1985), pp. 52\u201359."},{"key":"29_CR19","volume-title":"\"Communication 513 SAU-15\". IFIP WG.2.1","author":"D. Swierstra","year":"1985","unstructured":"Swierstra, D.: \"Communication 513 SAU-15\". IFIP WG.2.1, Sausalito, California, USA (1985)."},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF00290706","volume":"24","author":"M. Takeichi","year":"1987","unstructured":"Takeichi, M.: \"Partial Parametrization Eliminates Multiple Traversals of Data Structures\" Acta Informatica 24, (1987), pp.57\u201377.","journal-title":"Acta Informatica"},{"key":"29_CR21","volume-title":"Listlessness is Better than Laziness","author":"P. L. Wadler","year":"1985","unstructured":"Wadler, P.L.: \"Listlessness is Better than Laziness\" Ph. D. Thesis, Computer Science Department, CMU-CS-85-171, Carnegie Mellon University, Pittsburgh, USA (1985)."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18625-5_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:15:51Z","timestamp":1619558151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18625-5_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540186250","9783540480334"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-18625-5_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}