- General Chairs:
- Troels Henriksen,
- Artjoms Sinkarovs
Welcome to the 2023 edition on the ACM SIGPLAN Workshop on Libraries, Languages and Compilers for Array Programming, co-located with PLDI 2023.
Array programming unites two uncommon properties. As an abstraction, it directly mirrors mathematical concepts commonly used in many fields from natural sciences over engineering to financial modeling. As a language feature, it exposes regular control flow, exhibits structured data dependencies, and lends itself to many types of program analysis. Furthermore, many modern parallel computer architectures are well-suited to efficiently execute array operations.
The ARRAY series of workshops explores all aspects of array programming, such as languages, formal semantics, array theories, productivity/performance tradeoffs, libraries, notation such as including axis- and index-based approaches, intermediate languages, and efficient compilation.
Proceeding Downloads
A MultiGPU Performance-Portable Solution for Array Programming Based on Kokkos
Today, multiGPU nodes are widely used in high-performance computing and data centers. However, current programming models do not provide simple, transparent, and portable support for automatically targeting multiple GPUs within a node on application ...
HERO-ML: A Very High-Level Array Language for Executable Modelling of Data Parallel Algorithms
HERO-ML is an array language, on very high level, which is intended for specifying data parallel algorithms in a concise and platform-independent way where all the inherent data parallelism is easy to identify. The goal is to support the software ...
U-Net CNN in APL: Exploring Zero-Framework, Zero-Library Machine Learning
The APL notation would appear to be a clear match for convolutional neural networks, but traditional implementations of APL have lagged behind the performance of highly tuned, specialized frameworks designed to execute CNNs on the GPU. Moreover, most ...
Polymorphic Types with Polynomial Sizes
This article presents a compile-time analysis for tracking the size of data-structures in a statically typed and strict functional language. This information is valuable for static checking and code generation. Rather than relying on dependent ...
Towards Structured Algebraic Programming
Structured matrices and tensors exhibiting properties such as symmetry and fixed non-zero patterns are known for making algorithms and data storage more efficient. Due to emerging power and efficiency constraints required by the scale of modern ...
Faster APL with Lazy Extensions
April is a compiler from a subset of the APL language to Common Lisp. To realize a more performant and elegant APL implementation, April now defers the evaluation of certain types of input. This means that the compiler produces code building a tree of ...
Index Terms
- Proceedings of the 9th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| ARRAY'14 | 25 | 17 | 68% |
| Overall | 25 | 17 | 68% |