On optimising shape-generic array programs using symbolic structural information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4449 LNCS, Issue , 2007, Pages 1-18

  Trojahner, Kai ^a   Grelck, Clemens ^b   Scholz, Sven Bodo ^b  

^a UNIVERSITY OF LÜBECK   (Germany)

^b UNIVERSITY OF HERTFORDSHIRE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING; KNOWLEDGE ACQUISITION; OPTIMIZATION;

FUNCTIONAL ARRAY LANGUAGE; GENERIC CODE; SHAPE-GENERIC PROGRAMMING;

INFORMATION ANALYSIS;

EID: 38049134543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74130-5_1     Document Type: Conference Paper

References (24)

1. Scholz, S.B.: Single Assignment C -Efficient Support for High-Level Array Operations in a Functional Setting. Journal of Functional Programming 13(6), 1005-1059 (2003)
2. Grelck, C., Scholz, S.B.: SAC -A Functional Array Language for Efficient Multithreaded Execution. International Journal of Parallel Programming 34(4), 383-427 (2006)
3. Scholz, S.B.: With-loop-folding in SAC -Condensing Consecutive Array Operations. In: Clack, C., Hammond, K., Davie, T. (eds.) IFL 1997. LNCS, vol. 1467, pp. 72-92. Springer, Heidelberg (1998)
4. Grelck, C., Scholz, S.B., Trojahner, K.: With-Loop Scalarization: Merging Nested Array Operations. In: Trinder, P., Michaelson, G.J., Peña, R. (eds.) IFL 2003. LNCS, vol. 3145, pp. 118-134. Springer, Heidelberg (2004)
5. Grelck, C., Hinckfuß, K., Scholz, S.B.: With-Loop Fusion for Data Locality and Parallelism. In: Butterfield, A., Grelck, C., Huch, F. (eds.) IFL 2005. LNCS, vol. 4015, pp. 178-195. Springer, Heidelberg (2006)
6. Grelck, C., Trojahner, K.: Implicit Memory Management for SAC. In: Grelck, C., Huch, F. (eds.) Hardware Specification, Verification and Synthesis: Mathematical Aspects. LNCS, vol. 408, Springer, Heidelberg (1990)
7. Grelck, C., Scholz, S.B., Shafarenko, A.: A Binding-Scope Analysis for Generic Programs on Arrays. In: Butterfield, A. (ed.) IFL 2005. LNCS, vol. 4015, pp. 212-230. Springer, Heidelberg (2006)
8. Martin-Löf, P.: Intuitionistic Type Theory. Biblio-Napoli (1984)
9. Bernecky, R.: Shape Cliques. In: Horváth, Z., Zsók, V., eds.: Proceedings of the 18th International Symposium on Implementation of Functional Languages, IFL 2006, Budapest, Hungary, September 4-6, 2006, Eötvös Loránd University 1-12 (2006)
10. Jay, C., Steckler, P.: The Functional Imperative: Shape! In: Hankin, C. (ed.) ESOP 1998 and ETAPS 1998. LNCS, vol. 1381, pp. 139-153. Springer, Heidelberg (1998)
11. Kreye, D.: A Compilation Scheme for a Hierarchy of Array Types. In: Arts, T., Mohnen, M. (eds.) IFL 2001. LNCS, vol. 2312, pp. 24-26. Springer, Heidelberg (2002)
12. de Rose, L., Padua, D.: Techniques for the translation of matlab programs into fortran 90. ACM Transactions on Programming Languages and Systems 21(2), 286-323 (1999)
13. Joisha, P., Banerjee, P.: An algebraic array shape inference system for matlab. ACM Transactions on Programming Languages and Systems 28(5), 848-907 (2006)
14. McCosh, C.: Type-based specialization in a telescoping compiler for matlab. Master Thesis TR03-412, Rice University, Houston, Texas, USA (2003)
15. Bernecky, R.: Reducing Computational Complexity with Array Predicates. In: Picchi, S., Micocci, M. (eds.) Proceedings of the International Conference on Array Processing Languages (APL'98), Rome, Italy, pp. 46-54. ACM Press, New York (1998)
16. Augustsson, L.: Cayenne - a language with dependent types. In: International Conference on Functional Programming, pp. 239-250 (1998)
17. McBride, C., McKinna, J.: The view from the left. Journal of Functional Programming 14(1), 69-111 (2004)
18. Altenkirch, T., McBride, C., McKinna, J.: Why dependent types matter. Manuscript, available online (2005)
19. Xi, H., Pfenning, F.: Dependent Types in Practical Programming. In: Aiken, A. (ed.) Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'99), pp. 214-227. San Antonio, Texas, USA, ACM Press, New York (1999)
20. Xi, H.: Applied Type System (extended abstract). In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 394-408. Springer, Heidelberg (2004)
21. Zenger, C.: Indexed types. Theorectical Computer Science 187(1-2), 147-165 (1997)
22. Xi, H., Pfenning, F.: Eliminating array bound checking through dependent types. In: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, pp. 249-257 (1998)
23. Xi, H.: Dead code elimination through dependent types. In: Gupta, G. (ed.) PADL 1999. LNCS, vol. 1551, pp. 228-242. Springer, Heidelberg (1999)
24. McKinna, J., Brady, E.: Phase distinctions in the compilation of epigram. Draft, available online (2005)