Add to ORKGIn this thesis we present and analyse a set of automatic source-to-source program transformations that are suitable for incorporation in optimising compilers for lazy functional languages
This thesis discusses the idea of using domain specific languages for program transformation, and th...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
The aim of the FAST Project is to provide an implementation of a functional language, Haskell, on a ...
In this thesis we present and analyse a set of automatic source-to-source program transformations th...
AbstractMany compilers do some of their work by means of correctness-preserving, and hopefully perfo...
This thesis describes a complete compiler back-end for lazy functional languages, which uses various...
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding t...
A substantial amount of work has been devoted to the proof of correctness of various program analyse...
Abstract. Common subexpression elimination is a well-known compiler optimisation that saves time by ...
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding t...
Profiling tools, which measure and display the dynamic space and time behaviour of programs, are ess...
Functional programming languages are an ideal medium for program optimisations based on source-to-s...
Program synthesis was first proposed a few decades ago, but in the last decade it has gained increas...
International audienceParallel architectures are now omnipresent in mainstream electronic devices an...
AbstractThis work introduces a transformation methodology for functional logic programs based on nee...
This thesis discusses the idea of using domain specific languages for program transformation, and th...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
The aim of the FAST Project is to provide an implementation of a functional language, Haskell, on a ...
In this thesis we present and analyse a set of automatic source-to-source program transformations th...
AbstractMany compilers do some of their work by means of correctness-preserving, and hopefully perfo...
This thesis describes a complete compiler back-end for lazy functional languages, which uses various...
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding t...
A substantial amount of work has been devoted to the proof of correctness of various program analyse...
Abstract. Common subexpression elimination is a well-known compiler optimisation that saves time by ...
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding t...
Profiling tools, which measure and display the dynamic space and time behaviour of programs, are ess...
Functional programming languages are an ideal medium for program optimisations based on source-to-s...
Program synthesis was first proposed a few decades ago, but in the last decade it has gained increas...
International audienceParallel architectures are now omnipresent in mainstream electronic devices an...
AbstractThis work introduces a transformation methodology for functional logic programs based on nee...
This thesis discusses the idea of using domain specific languages for program transformation, and th...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
The aim of the FAST Project is to provide an implementation of a functional language, Haskell, on a ...