Optimising purely functional GPU programs

Compiling Purely Functional Structured Programs

We present a marriage of functional and structured imperative programming that embeds in pure lambda calculus. We describe how we implement the core of this language in a monadic DSL which is structurally equivalent to our intended source language and which, when evaluated, generates pure lambda terms in continuation-passing-style. 1. Pure Functional Programming One of the frequently touted ben...

From Functional Logic Programs to Purely Functional Programs Preserving Laziness

Functional logic languages extend the setting of functional programming by non-deterministic choices, free variables and narrowing. Most existing approaches to simulate logic features in functional languages do not preserve laziness, i.e., they can only model strict logic programming like in Prolog. Lazy functional logic programming however, has interesting properties supporting a more declarat...

Implementing Functional Logic Programs by Translation into Purely Functional Programs

Towards a Purely Functional Debugger for Functional Programs

A major drawback when developing large applications with functional programming languages is the lack of good debugging tools—when using imperative languages all sorts of useful information about the program’s behaviour is available via a good debugger. In this paper we present a debugging technique that allows the examination of the behaviour of programmer defined functions in the context of t...

Optimising the memory management of higher order functional programs

Set of all subsets of A P fin (A) Set of all finite subsets of A A B Disjoint union of sets A and B A i | i ∈ I Family of sets A i with index set I (see Appendix A) f : A B Partial function Dom(f) Domain of partial function f f ∪ g Union of functions f and g with Dom(f) ∩ Dom(g) = ∅: (f ∪ g)(a) := f (a) if a ∈ Dom(f) g(a) if a ∈ Dom(g) id Identity function undef Function with empty domain, i.e....