I will present a Haskell implementation of computing the L1 matrix norm, which plays an important role in classical bounds of Bell-type nonlocal games. I will transform this implementation so as to prepare an efficient Haskell algorithm, then I will sketch implementations of variants of the algorithm and challenges of different backends (CPU, GPU, FPGA).