19 citations · 27 across the 7 of their papers we have counts for
7 papers
Comparing Parallel Functional Array Languages: Programming and Performance
David van Balen, Tiziano De Matteis, Clemens Grelck +12
Parallel functional array languages are an emerging class of programming languages that promise to combine low-effort parallel programming with good performance and performance por…
Special Delivery: Programming with Mailbox Types (Extended Version)
Simon Fowler, Duncan Paul Attard, Danielle Marshall +2
The asynchronous and unidirectional communication model supported by mailboxes is a key reason for the success of actor languages like Erlang and Elixir for implementing reliable a…
Parallel Flowshop in YewPar
Ignas Knizikevičius, Phil Trinder, Blair Archibald +1
Parallelism may reduce the time to find exact solutions for many Operations Research (OR) problems, but parallelising combinatorial search is extremely challenging. YewPar is a new…
Do Fewer Tiers Mean Fewer Tears? Eliminating Web Stack Components to Improve Interoperability
Adrian Ramsingh, Jeremy Singer, Phil Trinder
Web applications are structured as multi-tier stacks of components. Each component may be written in a different language and interoperate using a variety of protocols. Such intero…
Sketch-Guided Equality Saturation: Scaling Equality Saturation to Complex Optimizations of Functional Programs
Thomas Koehler, Phil Trinder, Michel Steuwer
Generating high-performance code for diverse hardware and application domains is challenging. Functional array programming languages with patterns like map and reduce have been suc…
Scaling Reliably: Improving the Scalability of the Erlang Distributed Actor Platform
Phil Trinder, Natalia Chechina, Nikolaos Papaspyrou +22
Distributed actor languages are an effective means of constructing scalable reliable systems, and the Erlang programming language has a well-established and influential model. Whil…
Replicable Parallel Branch and Bound Search
Blair Archibald, Patrick Maier, Ciaran McCreesh +2
Combinatorial branch and bound searches are a common technique for solving global optimisation and decision problems. Their performance often depends on good search order heuristic…