Krste Asanovic, Ras Bodik, Bryan Christopher Catanzaro, Joseph James Gebis, Parry Husbands, Kurt Keutzer, David A. Patterson, William Lester Plishker, John Shalf, Samuel Webb Williams & Katherine A. Yelick (2006):
The Landscape of Parallel Computing Research: A View from Berkeley.
Technical Report UCB/EECS-2006-183.
EECS Department, University of California, Berkeley.
R.F. Barrett, P.C. Roth & S.W. Poole (2007):
Finite Difference Stencils Implemented Using Chapel.
Oak Ridge National Laboratory, Tech. Rep. ORNL Technical Report TM-2007/122.
R. Bod\'ık, R. Gupta & V. Sarkar (2000):
ABCD: Eliminating Array Bounds Checks on Demand.
ACM SIGPLAN Notices 35(5),
pp. 321–333,
doi:10.1145/358438.349342.
Manuel M. T. Chakravarty, Gabriele Keller & Simon Peyton Jones (2005):
Associated type synonyms.
In: ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming.
ACM,
New York, NY, USA,
pp. 241–253,
doi:10.1145/1086365.1086397.
K. Datta, M. Murphy, V. Volkov, S. Williams, J. Carter, L. Oliker, D. Patterson, J. Shalf & K. Yelick (2008):
Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures.
In: Proceedings of the 2008 ACM/IEEE conference on Supercomputing.
IEEE Press,
pp. 1–12.
L.J. Guillemette & S. Monnier (2008):
A type-preserving compiler in Haskell.
In: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming.
ACM,
pp. 75–86,
doi:10.1145/1411203.1411218.
C.V. Hall, K. Hammond, S.L. Peyton Jones & P.L. Wadler (1996):
Type classes in Haskell.
ACM Transactions on Programming Languages and Systems (TOPLAS) 18(2),
pp. 109–138,
doi:10.1145/227699.227700.
R. Jain, R. Kasturi & B.G. Schunck (1995):
Machine vision 5.
McGraw-Hill New York.
S. Kamil, K. Datta, S. Williams, L. Oliker, J. Shalf & K. Yelick (2006):
Implicit and explicit optimizations for stencil computations.
In: Proceedings of the 2006 workshop on Memory system performance and correctness.
ACM,
pp. 51–60,
doi:10.1145/1178597.1178605.
Gabriele Keller, Manuel M.T. Chakravarty, Roman Leshchinskiy, Simon Peyton Jones & Ben Lippmeier (2010):
Regular, shape-polymorphic, parallel arrays in Haskell.
ICFP '10.
ACM,
New York, NY, USA,
pp. 261–272,
doi:10.1145/1863543.1863582.
Oleg Kiselyov, Ralf Lämmel & Keean Schupke (2004):
Strongly typed heterogeneous collections.
Haskell '04.
ACM,
New York, NY, USA,
pp. 96–107,
doi:10.1145/1017472.1017488.
S. Krishnamoorthy, M. Baskaran, U. Bondhugula, J. Ramanujam, A. Rountev & P. Sadayappan (2007):
Effective Automatic Parallelization of Stencil Computations.
ACM Sigplan Notices 42(6),
pp. 235–244,
doi:10.1145/1250734.1250761.
Michael Lesniak (2010):
PASTHA: parallelizing stencil calculations in Haskell.
In: Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming,
DAMP '10.
ACM,
New York, NY, USA,
pp. 5–14,
doi:10.1145/1708046.1708052.
Geoffrey Mainland (2007):
Why it's Nice to be Quoted: Quasiquoting for Haskell.
In: Haskell '07.
ACM,
New York, NY, USA,
pp. 73–82,
doi:10.1145/1291201.1291211.
V. Markstein, J. Cocke & P. Markstein (1982):
Optimization of range checking.
In: ACM SIGPLAN Notices 17.
ACM,
pp. 114–119.
Dominic Orchard, Max Bolingbroke & Alan Mycroft (2010):
Ypnos: Declarative, Parallel Structured Grid Programming.
In: DAMP '10: Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming.
ACM,
NY, USA,
pp. 15–24,
doi:10.1145/1708046.1708053.
Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich & Geoffrey Washburn (2006):
Simple unification-based type inference for GADTs.
In: Proceedings of ACM SIGPLAN international conference on Functional programming,
ICFP '06.
ACM,
New York, NY, USA,
pp. 50–61,
doi:10.1145/1159803.1159811.
Simon Peyton Jones, Geoffrey Washburn & Stephanie Weirich (July 2004):
Wobbly Types: Type Inference for Generalised Algebraic Data Types.
Technical Report.
Simon Peyton Jones (2003):
Haskell 98 Language and Libraries: The Revised Report.
Cambridge University Press.
M. Sackman & S. Eisenbach:
Safely Speaking in Tongues.
In: Preliminary Proceedings of the Ninth Workshop on Language Descriptions Tools and Applications LDTA 2009,
pp. 34.
Sven-Bodo Scholz (2003):
Single Assignment C: efficient support for high-level array operations in a functional setting.
Journal of Functional Programming 13(6),
pp. 1005–1059,
doi:10.1017/S0956796802004458.
T. Sheard, J. Hook & N. Linger:
GADTs + extensible kinds = dependent programming.
http://www.cs.pdx.edu/ sheard/papers/GADT+ExtKinds.ps.
Don Stewart (2009):
Domain Specific Languages for Domain Specific Problems.
In: Workshop on Non-Traditional Programming Models for High-Performance Computing, LACSS.
W. Swierstra & T. Altenkirch (2008):
Dependent types for distributed arrays.
In: Proceedings of the Ninth Symposium on Trends in Functional Programming.
Citeseer.
T. Würthinger, C. Wimmer & H. Mössenböck (2007):
Array bounds check elimination for the Java HotSpot(TM) client compiler.
In: Proceedings of the 5th international symposium on Principles and practice of programming in Java.
ACM,
pp. 125–133,
doi:10.1145/1294325.1294343.
H. Xi (1998):
Dependent Types in Practical Programming.
Carnegie Mellon University.
H. Xi & F. Pfenning (1999):
Dependent Types in Practical Programming.
In: Conference Record Of The ACM Sypmosium On Principles Of Programming Languages 26,
pp. 214–227,
doi:10.1145/292540.292560.
L.T. Yang & M. Guo (2006):
High-performance computing: Paradigm and Infrastructure.
John Wiley and Sons.
K. Yelick, P. Hilfinger, S. Graham, D. Bonachea, J. Su, A. Kamil, K. Datta, P. Colella & T. Wen (2007):
Parallel Languages and Compilers: Perspective from the Titanium experience.
International Journal of High Performance Computing Applications 21(3),
pp. 266,
doi:10.1177/1094342007078449.
eptcs@eptcs.org