AbstractMany compilers do some of their work by means of correctness-preserving, and hopefully performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) takes this idea of “compilation by transformation” as its war-cry, trying to express as much as possible of the compilation process in the form of program transformations.This paper reports on our practical experience of the transformational approach to compilation, in the context of a substantial compiler
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
We present a simple, automatic transformation — the foldr/build transformation — which successfully ...
Functional programming languages such as Haskell are fundamentally different from imperative languag...
AbstractMany compilers do some of their work by means of correctness-preserving, and hopefully perfo...
Many compilers do some of their work by means of correctness-preserving, and hopefully performance-i...
In this thesis we present and analyse a set of automatic source-to-source program transformations th...
Abstract. This paper describes our experience using the HERMIT tool-kit to apply well-known transfor...
AbstractWe demonstrate the Haskell Refactorer, HaRe, both as an example of a fully-functional tool f...
AbstractThe use of typed intermediate languages can significantly increase the reliability of a comp...
This paper describes our experience using the HERMIT tool- kit to apply well-known transformations ...
AbstractA compiler optimization is sound if the optimized program that it produces is semantically e...
technical reportThis thesis describes the high-level transformation phase of a prototype PSL compile...
The importance of reasoning about and refactoring programs is a central tenet of functional programm...
The aim of the FAST Project is to provide an implementation of a functional language, Haskell, on a ...
Every compiler passes code through several stages, each a sort of mini- compiler of its own. Thus...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
We present a simple, automatic transformation — the foldr/build transformation — which successfully ...
Functional programming languages such as Haskell are fundamentally different from imperative languag...
AbstractMany compilers do some of their work by means of correctness-preserving, and hopefully perfo...
Many compilers do some of their work by means of correctness-preserving, and hopefully performance-i...
In this thesis we present and analyse a set of automatic source-to-source program transformations th...
Abstract. This paper describes our experience using the HERMIT tool-kit to apply well-known transfor...
AbstractWe demonstrate the Haskell Refactorer, HaRe, both as an example of a fully-functional tool f...
AbstractThe use of typed intermediate languages can significantly increase the reliability of a comp...
This paper describes our experience using the HERMIT tool- kit to apply well-known transformations ...
AbstractA compiler optimization is sound if the optimized program that it produces is semantically e...
technical reportThis thesis describes the high-level transformation phase of a prototype PSL compile...
The importance of reasoning about and refactoring programs is a central tenet of functional programm...
The aim of the FAST Project is to provide an implementation of a functional language, Haskell, on a ...
Every compiler passes code through several stages, each a sort of mini- compiler of its own. Thus...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
We present a simple, automatic transformation — the foldr/build transformation — which successfully ...
Functional programming languages such as Haskell are fundamentally different from imperative languag...