Accelerating Haskell array codes with multicore GPUs

MMT Chakravarty, G Keller, S Lee… - Proceedings of the sixth …, 2011 - dl.acm.org
Current GPUs are massively parallel multicore processors optimised for workloads with a
large degree of SIMD parallelism. Good performance requires highly idiomatic programs …

Optimising purely functional GPU programs

TL McDonell, MMT Chakravarty, G Keller… - ACM SIGPLAN …, 2013 - dl.acm.org
Purely functional, embedded array programs are a good match for SIMD hardware, such as
GPUs. However, the naive compilation of such programs quickly leads to both code …

Folding domain-specific languages: deep and shallow embeddings (functional pearl)

J Gibbons, N Wu - Proceedings of the 19th ACM SIGPLAN international …, 2014 - dl.acm.org
A domain-specific language can be implemented by embedding within a general-purpose
host language. This embedding may be deep or shallow, depending on whether terms in the …

Nikola: embedding compiled GPU functions in Haskell

G Mainland, G Morrisett - Proceedings of the third ACM Haskell …, 2010 - dl.acm.org
We describe Nikola, a first-order language of array computations embedded in Haskell that
compiles to GPUs via CUDA using a new set of type-directed techniques to support re …

Embedding session types in Haskell

S Lindley, JG Morris - ACM SIGPLAN Notices, 2016 - dl.acm.org
We present a novel embedding of session-typed concurrency in Haskell. We extend an
existing HOAS embedding of linear λ-calculus with a set of core session-typed primitives …

A presheaf model of parametric type theory

JP Bernardy, T Coquand, G Moulin - Electronic Notes in Theoretical …, 2015 - Elsevier
We extend Martin-Löf's Logical Framework with special constructions and typing rules
providing internalized parametricity. Compared to previous similar proposals, this version …

Typed tagless final interpreters

O Kiselyov - … and indexed programming: International spring school …, 2012 - Springer
The so-called 'typed tagless final'approach of [6] has collected and polished a number of
techniques for representing typed higher-order languages in a typed metalanguage, along …

A computational interpretation of parametricity

JP Bernardy, G Moulin - … Annual IEEE Symposium on Logic in …, 2012 - ieeexplore.ieee.org
Reynolds' abstraction theorem has recently been extended to lambda-calculi with
dependent types. In this paper, we show how this theorem can be internalized. More …

Certified symbolic management of financial multi-party contracts

P Bahr, J Berthold, M Elsman - ACM SIGPLAN Notices, 2015 - dl.acm.org
Domain-specific languages (DSLs) for complex financial contracts are in practical use in
many banks and financial institutions today. Given the level of automation and …

Type-safe runtime code generation: accelerate to LLVM

TL McDonell, MMT Chakravarty, V Grover… - ACM SIGPLAN …, 2015 - dl.acm.org
Embedded languages are often compiled at application runtime; thus, embedded compile-
time errors become application runtime errors. We argue that advanced type system …