How functional programming mattered
In 1989 when functional programming was still considered a niche topic, Hughes wrote a
visionary paper arguing convincingly 'why functional programming matters'. More than two …
visionary paper arguing convincingly 'why functional programming matters'. More than two …
SyDPaCC: A Framework for the Development of Verified Scalable Parallel Functional Programs
F Loulergue, J Ischard - … Symposium on Leveraging Applications of Formal …, 2024 - Springer
The SyDPaCC framework supports the development of scalable parallel functional
programs with Coq and helps the developers to write correct-by-construction programs with …
programs with Coq and helps the developers to write correct-by-construction programs with …
Automatic parallelization of recursive functions using quantifier elimination
A Morihata, K Matsuzaki - International Symposium on Functional and …, 2010 - Springer
Although the recent popularity of parallel-computing environments has called for parallel
programs, it is difficult for nonspecialists to develop those that are efficient. What is required …
programs, it is difficult for nonspecialists to develop those that are efficient. What is required …
Implementing fusion-equipped parallel skeletons by expression templates
K Matsuzaki, K Emoto - … Symposium on Implementation and Application of …, 2009 - Springer
Develo** efficient parallel programs is more difficult and complicated than develo**
sequential ones. Skeletal parallelism is a promising methodology for easy parallel …
sequential ones. Skeletal parallelism is a promising methodology for easy parallel …
Financial software on GPUs: between Haskell and Fortran
This paper presents a real-world pricing kernel for financial derivatives and evaluates the
language and compiler tool chain that would allow expressive, hardware-neutral algorithm …
language and compiler tool chain that would allow expressive, hardware-neutral algorithm …
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important
parallel algorithms to implement efficient parallel programs manipulating trees. Despite their …
parallel algorithms to implement efficient parallel programs manipulating trees. Despite their …
Towards verified scalable parallel computing with Coq and Spark
SyDPaCC (Systematic Development of programs for Parallel and Cloud Computing) is a
framework for the Coq interactive theorem prover. It allows to systematically develop correct …
framework for the Coq interactive theorem prover. It allows to systematically develop correct …
An accumulative parallel skeleton for all
Parallel skeletons intend to encourage programmers to build a parallel program from ready-
made components for which efficient implementations are known to exist, making the …
made components for which efficient implementations are known to exist, making the …
PySke: algorithmic skeletons for Python
PySke is a library of parallel algorithmic skeletons in Python designed for list and tree data
structures. Such algorithmic skeletons are high-order functions implemented in parallel. An …
structures. Such algorithmic skeletons are high-order functions implemented in parallel. An …
Parallelization with tree skeletons
Trees are useful data structures, but to design efficient parallel programs over trees is known
to be more difficult than to do over lists. Although several important tree skeletons have been …
to be more difficult than to do over lists. Although several important tree skeletons have been …