{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:13Z","timestamp":1725487993858},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425588"},{"type":"electronic","value":"9783540448068"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44806-3_12","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T18:21:36Z","timestamp":1184955696000},"page":"199-218","source":"Crossref","is-referenced-by-count":3,"title":["A Transformational Approach which Combines Size Inference and Program Optimization"],"prefix":"10.1007","author":[{"given":"Christoph A.","family":"Herrmann","sequence":"first","affiliation":[]},{"given":"Christian","family":"Lengauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,3]]},"reference":[{"issue":"8","key":"12_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/258949.258953","volume":"32","author":"J. M. Bell","year":"1997","unstructured":"Jeffrey M. Bell, Fran\u00e7oise Bellegarde, and James Hook. Type-driven defunctionalization. SIGPLAN Notices, 32(8):25\u201337, 1997.","journal-title":"SIGPLAN Notices"},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-62688-3_26","volume-title":"Typed Lambda Calculi and Applications (TLCA\u201997)","author":"G. Bell\u00e8","year":"1997","unstructured":"Gianni Bell\u00e8 and Eugenio Moggi. Typed intermediate languages for shape-analysis. In Typed Lambda Calculi and Applications (TLCA\u201997), Lecture Notes in Computer Science 1210, pages 11\u201329. Springer-Verlag, 1997."},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1093\/comjnl\/32.2.122","volume":"32","author":"R. S. Bird","year":"1989","unstructured":"Richard S. Bird. Algebraic identities for program calculation. The Computer Journal, 32(2):122\u2013126, 1989.","journal-title":"The Computer Journal"},{"key":"12_CR4","series-title":"Technical Report CMU-CS-91-118","volume-title":"Size and access inference for data-parallel programs","author":"S. Chatterjee","year":"1991","unstructured":"Siddharta Chatterjee, Guy E. Blelloch, and Allan L. Fisher. Size and access inference for data-parallel programs. Technical Report CMU-CS-91-118, Dept. Computer Science, Carnegie-Mellon Univ., 1991."},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3-540-57264-3_35","volume-title":"Static Analysis Third Int. Workshop (WAS\u201993)","author":"W.-N. Chin","year":"1993","unstructured":"Wei-Ngan Chin and Siau-Cheng Khoo. Tupling functions with multiple recursion parameters. In Patrick Cousot, Moreno Falaschi, Gilberto File, and Antoine Rauzy, editors, Static Analysis Third Int. Workshop (WAS\u201993), Lecture Notes in Computer Science 724, pages 124\u2013140. Springer-Verlag, 1993."},{"key":"12_CR6","first-page":"62","volume-title":"Proceedings of the 2000 ACM SIGPLAN Workshop on Evaluation and Semantics-Based Program Manipulation (PEPM-00)","author":"W.-N. Chin","year":"2000","unstructured":"Wei-Ngan Chin and Siau-Cheng Khoo. Calculating sized types. In Proceedings of the 2000 ACM SIGPLAN Workshop on Evaluation and Semantics-Based Program Manipulation (PEPM-00), pages 62\u201372, N.Y., 2000. ACM Press."},{"key":"12_CR7","series-title":"Technical report","volume-title":"A tutorial on Lava: A hardware description and verification system","author":"K. Claessen","year":"2000","unstructured":"Koen Claessen and Mary Sheeran. A tutorial on Lava: A hardware description and verification system. Technical report, Dept. of Computing Science, Chalmers University of Technology, August 2000."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Proc. 4th ACM Symp. Principles of Programming Languages (POPL\u201977), pages 238\u2013252. ACM Press, 1977.","DOI":"10.1145\/512950.512973"},{"key":"12_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-56891-3_12","volume-title":"PARLE\u201993: Parallel Architectures and Languages Europe","author":"J. Darlington","year":"1993","unstructured":"John Darlington, Anthony Field, Peter Harrison, Paul Kelly, David Sharp, Qian Wu, and Ronald L. While. Parallel programming using skeleton functions. In Arndt Bode, Mike Reeve, and Gottfried Wolf, editors, PARLE\u201993: Parallel Architectures and Languages Europe, Lecture Notes in Computer Science 694, pages 146\u2013160. Springer-Verlag, 1993."},{"key":"12_CR10","series-title":"Technical Report CSE-99-005","volume-title":"Symbolic simulation of microprocessor models using type classes in Haskell","author":"N. A. Day","year":"1999","unstructured":"Nancy A. Day, Jeffrey R. Lewis, and Byrin Cook. Symbolic simulation of microprocessor models using type classes in Haskell. Technical Report CSE-99-005, Pacific Software Research Center, Oregon Graduate Institute, 1999."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Roberto Di Cosmo. Isomorphisms of Types: from \u03bb-calculus to information retrieval and language design. Progress in Theoretical Computer Science. Birkh\u00e4user, 1995.","DOI":"10.1007\/978-1-4612-2572-0"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Pascal Fradet and Julien Mallet. Compilation of a specialized functional language for massively parallel computers. Technical Report 3894, Institut National der Recherche en Informatique et en Automatique (INRIA), 2000.","DOI":"10.1017\/S0956796800003816"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6423(97)00014-2","volume":"33","author":"S. Gorlatch","year":"1999","unstructured":"Sergei Gorlatch. Extracting and implementing list homomorphisms in parallel program development. Science of Computer Programming, 33(1):1\u201327, 1999.","journal-title":"Science of Computer Programming"},{"key":"12_CR14","unstructured":"Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics. Addison-Wesley Publishing Company, 1994."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Per Hammarlund and Bj\u00f6rn Lisper. On the relation between functional and data parallel programming languages. In Proc. Sixth Conf. on Functional Programming Languages and Computer Architecture (FPCA\u201993), pages 210\u2013222. ACM Press, 1993.","DOI":"10.1145\/165180.165211"},{"key":"12_CR16","unstructured":"haskell.org, 2000. http:\/\/www.haskell.org ."},{"key":"12_CR17","first-page":"346","volume-title":"Proc. 10th Int. Workshop on the Implementation of Functional Languages (IFL\u201998)","author":"C. A. Herrmann","year":"1998","unstructured":"Christoph A. Herrmann and Christian Lengauer. Size inference of nested lists in functional programs. In Kevin Hammond, Tony Davie, and Chris Clack, editors, Proc. 10th Int. Workshop on the Implementation of Functional Languages (IFL\u201998), pages 346\u2013364. Dept. Computer Science, Univ. College London, 1998."},{"key":"12_CR18","series-title":"Technical Report MIP-9907","volume-title":"A compiler for HDC","author":"C. A. Herrmann","year":"1999","unstructured":"Christoph A. Herrmann, Christian Lengauer, Robert G\u00fcnz, Jan Laitenberger, and Christian Schaller. A compiler for HDC. Technical Report MIP-9907, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Univ. Passau, May 1999."},{"key":"12_CR19","series-title":"PhD thesis","volume-title":"The Skeleton-Based Parallelization of Divide-and-Conquer Recursions","author":"C. A. Herrmann","year":"2000","unstructured":"Christoph A. Herrmann. The Skeleton-Based Parallelization of Divide-and-Conquer Recursions. PhD thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Univ. Passau. Logos-Verlag, Berlin, 2000."},{"issue":"2-3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0129-6264(00)00023-8","volume":"10","author":"C. A. Herrmann","year":"2000","unstructured":"Christoph A. Herrmann and Christian Lengauer. HDC: A higher-order language for divide-and-conquer. Parallel Processing Letters, 10(2-3):239\u2013250, 2000.","journal-title":"Parallel Processing Letters"},{"key":"12_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-46425-5_11","volume-title":"Programming Languages and Systems (ESOP 2000)","author":"M. Hofmann","year":"2000","unstructured":"Martin Hofmann. A type system for bounded space and functional in-place update-extended abstract. In Gerd Smolka, editor, Programming Languages and Systems (ESOP 2000), Lecture Notes in Computer Science 1782, pages 165\u2013179. Springer-Verlag, 2000."},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"John Hughes, Lars Pareto, and Amr Sabry. Proving the correctness of reactive systems using sized types. In Proc. 23rd Ann. ACM Symp. on Principles of Programming Languages (POPL\u201996), pages 410\u2013423. ACM Press, 1996.","DOI":"10.1145\/237721.240882"},{"key":"12_CR23","unstructured":"C. Barry Jay and Milan Sekanina. Shape checking of array programs. In J. Harland, editor, Proc. Australasian Theory Seminar on Computing, volume 19 of Australian Computer Science Communications, pages 113\u2013121, 1997."},{"key":"12_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/3-540-58485-4_42","volume-title":"Static Analysis (SAS\u201994)","author":"B. Lisper","year":"1994","unstructured":"Bj\u00f6rn Lisper and Jean-Fran\u00e7ois Collard. Extent analysis of data fields. In Baudouin Le Charlier, editor, Static Analysis (SAS\u201994), Lecture Notes in Computer Science 864, pages 208\u2013222. Springer-Verlag, 1994."},{"key":"12_CR25","unstructured":"Hans-Wolfgang Loidl and Kevin Hammond. A sized time system for a parallel functional language. In Proc. 1996 Glasgow Workshop on Functional Programming, 1996. Electronic publication: http:\/\/www.dcs.gla.ac.uk\/fp\/workshops\/fpw96\/Proceedings96.html ."},{"issue":"6","key":"12_CR26","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1145\/197320.197356","volume":"16","author":"J. Misra","year":"1994","unstructured":"Jayadev Misra. Powerlist: A structure for parallel recursion. ACM Trans. on Programming Languages and Systems, 16(6):1737\u20131767, November 1994.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Flemming Nielson and Hanne Riis Nielson. Two-level functional languages. Number 34 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511526572"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"John T. O\u2019Donnell. Bidirectional fold and scan. In Functional Programming: Glasgow 1993, Workshops in Computing, pages 193\u2013200. Springer-Verlag, 1994.","DOI":"10.1007\/978-1-4471-3236-3_16"},{"key":"12_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-60675-0_46","volume-title":"Functional Programming Languages in Education","author":"J. T. O\u2019Donnell","year":"1995","unstructured":"John T. O\u2019Donnell. From transistors to computer architecture: Teaching functional circuit specification in Hydra. In Pieter H. Hartel and Rinus Plasmeijer, editors, Functional Programming Languages in Education, Lecture Notes in Computer Science 1022, pages 195\u2013214. Springer-Verlag, 1995."},{"key":"12_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/978-3-540-45099-3_19","volume-title":"Static Analysis (SAS\u20192000)","author":"J. Riely","year":"2000","unstructured":"James Riely and Jan Prins. Flattening is an improvement. In Jens Palsberg, editor, Static Analysis (SAS\u20192000), Lecture Notes in Computer Science 1824, pages 360\u2013376. Springer-Verlag, 2000."},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Philip Wadler. Views: A way for pattern matching to cohabit with data abstraction. In Proc. 14th ACM Symp. Principles of Programming Languages (POPL\u201987), pages 307\u2013313. ACM Press, 1987.","DOI":"10.1145\/41625.41653"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In Proc. 26th ACM Symp. Principles of Programming Languages (POPL\u201999), pages 214\u2013227. ACM Press, 1999.","DOI":"10.1145\/292540.292560"}],"container-title":["Lecture Notes in Computer Science","Semantics, Applications, and Implementation of Program Generation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44806-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T05:27:27Z","timestamp":1629437247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44806-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425588","9783540448068"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-44806-3_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}