{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:17:37Z","timestamp":1725477457225},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691747"},{"type":"electronic","value":"9783540691754"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11964681_1","type":"book-chapter","created":{"date-parts":[[2007,1,19]],"date-time":"2007-01-19T05:48:37Z","timestamp":1169185717000},"page":"1-18","source":"Crossref","is-referenced-by-count":6,"title":["A Framework for Point-Free Program Transformation"],"prefix":"10.1007","author":[{"given":"Alcino","family":"Cunha","sequence":"first","affiliation":[]},{"given":"Jorge Sousa","family":"Pinto","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Proen\u00e7a","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"1_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"Backus, J.: Can programming be liberated from the von Neumann style? a functional style and its algebra of programs. Communications of the ACM\u00a021(8), 613\u2013641 (1978)","journal-title":"Communications of the ACM"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1145\/1780.1781","volume":"6","author":"R. Bird","year":"1984","unstructured":"Bird, R.: The promotion and accumulation strategies in transformational programming. ACM Transactions on Programming Languages and Systems\u00a06(4), 487\u2013504 (1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR3","unstructured":"Cunha, A.: Point-free Program Calculation. PhD thesis, Departamento de Inform\u00e1tica, Universidade do Minho (2005)"},{"issue":"4","key":"1_CR4","first-page":"315","volume":"66","author":"A. Cunha","year":"2005","unstructured":"Cunha, A., Pinto, J.S.: Point-free program transformation. Fundamenta Informaticae\u00a066(4), 315\u2013352 (2005); Special Issue on Program Transformation","journal-title":"Fundamenta Informaticae"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Curien, P.-L.: Categorical Combinators, Sequential Algorithms, and Functional Programming, 2nd edn. Birkhuser (1993)","DOI":"10.1007\/978-1-4612-0317-9"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-27764-4_6","volume-title":"Mathematics of Program Construction","author":"N.A. Danielsson","year":"2004","unstructured":"Danielsson, N.A., Jansson, P.: Chasing bottoms, a case study in program verification in the presence of partial and infinite values. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 85\u2013109. Springer, Heidelberg (2004)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/10704973_3","volume-title":"Advanced Functional Programming","author":"O. Moor de","year":"1999","unstructured":"de Moor, O., Sittampalam, G.: Generic program transformation. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol.\u00a01608, pp. 116\u2013149. Springer, Heidelberg (1999)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-47797-7_5","volume-title":"Algebraic and Coalgebraic Methods in the Mathematics of Program Construction","author":"J. Gibbons","year":"2002","unstructured":"Gibbons, J.: Calculating functional programs. In: Blackhouse, R., Crole, R.L., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS, vol.\u00a02297, pp. 148\u2013203. Springer, Heidelberg (2002)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/232627.232637","volume-title":"Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP 1996)","author":"Z. Hu","year":"1996","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M.: Deriving structural hylomorphisms from recursive definitions. In: Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP 1996), pp. 73\u201382. ACM Press, New York (1996)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-46425-5_15","volume-title":"Programming Languages and Systems","author":"M.P. Jones","year":"2000","unstructured":"Jones, M.P.: Type classes with functional dependencies. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, p. 230. Springer, Heidelberg (2000)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-45587-6_10","volume-title":"Practical Aspects of Declarative Languages","author":"R. L\u00e4mmel","year":"2002","unstructured":"L\u00e4mmel, R., Visser, J.: Typed combinators for generic traversal. In: Krishnamurthi, S., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol.\u00a02257, pp. 137\u2013154. Springer, Heidelberg (2002)"},{"key":"1_CR12","first-page":"375","volume-title":"To H. B. Curry: Essays on Combinatory Logic","author":"J. Lambek","year":"1980","unstructured":"Lambek, J.: From lambda calculus to cartesian closed categories. In: Seldin, J.P., Hindley, J.R. (eds.) To H. B. Curry: Essays on Combinatory Logic, pp. 375\u2013402. Academic Press, London (1980)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Functional Programming Languages and Computer Architecture","author":"E. Meijer","year":"1991","unstructured":"Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, Springer, Heidelberg (1991)"},{"key":"1_CR14","volume-title":"Proceedings of the 7th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA 1995)","author":"E. Meijer","year":"1995","unstructured":"Meijer, E., Hutton, G.: Bananas in space: Extending fold and unfold to exponential types. In: Proceedings of the 7th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA 1995). ACM Press, New York (1995)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-27861-0_11","volume-title":"Implementation of Functional Languages","author":"U. Norell","year":"2004","unstructured":"Norell, U., Jansson, P.: Polytypic programming in haskell. In: Trinder, P., Michaelson, G.J., Pe\u00f1a, R. (eds.) IFL 2003. LNCS, vol.\u00a03145, pp. 168\u2013184. Springer, Heidelberg (2004)"},{"key":"1_CR16","unstructured":"Proen\u00e7a, J.: Point-free simplification. Technical Report DI-PURe-05.06.01, Universidade do Minho (2005)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11964681_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:39Z","timestamp":1605643239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11964681_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540691747","9783540691754"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11964681_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}