Add to ORKGINST: L_042GRIN is short for Graph Reduction Intermediate Notation, a modern back end for lazy functional languages. Most of the currently available compilers for such languages share a common flaw: they can only optimize programs on a per-module basis. The GRIN framework allows for interprocedural whole program analysis, enabling optimizing code transformations across functions and modules as well
In this thesis we present and analyse a set of automatic source-to-source program transformations th...
In this paper we present a new programming technique for lazy functional programming languages. The ...
A system based on the notion of a flow graph is used to specify formally and to implement a compiler...
GRIN is short for Graph Reduction Intermediate Notation, a modern back end for lazy functional langu...
This thesis describes a complete compiler back-end for lazy functional languages, which uses various...
Every compiler passes code through several stages, each a sort of mini- compiler of its own. Thus...
A compiler is a program that translates a source program written in a high-level programming languag...
Automatic optimizers for computer programs work with a fixed list of rote transformations, while hu...
This is the language manual for OPTIMIX, the optimizer generator. It can be used to generate program...
The front end of a compiler is generally responsible for creating an intermediate representation of ...
An optimizing compiler consists of a front end parsing a textual programming language into an inter-...
Much of the work on applications of meta-level primitives in logic pro-grams focusses on high-level ...
The challenge of the Compiler Optimization Case [2] is to perform local optimizations and instructio...
Our goal is to develop a new and highly flexible approach to program optimization. Instead of apply...
In Part I [5], we proposed an approach to formally describe and compare functional languages impleme...
In this thesis we present and analyse a set of automatic source-to-source program transformations th...
In this paper we present a new programming technique for lazy functional programming languages. The ...
A system based on the notion of a flow graph is used to specify formally and to implement a compiler...
GRIN is short for Graph Reduction Intermediate Notation, a modern back end for lazy functional langu...
This thesis describes a complete compiler back-end for lazy functional languages, which uses various...
Every compiler passes code through several stages, each a sort of mini- compiler of its own. Thus...
A compiler is a program that translates a source program written in a high-level programming languag...
Automatic optimizers for computer programs work with a fixed list of rote transformations, while hu...
This is the language manual for OPTIMIX, the optimizer generator. It can be used to generate program...
The front end of a compiler is generally responsible for creating an intermediate representation of ...
An optimizing compiler consists of a front end parsing a textual programming language into an inter-...
Much of the work on applications of meta-level primitives in logic pro-grams focusses on high-level ...
The challenge of the Compiler Optimization Case [2] is to perform local optimizations and instructio...
Our goal is to develop a new and highly flexible approach to program optimization. Instead of apply...
In Part I [5], we proposed an approach to formally describe and compare functional languages impleme...
In this thesis we present and analyse a set of automatic source-to-source program transformations th...
In this paper we present a new programming technique for lazy functional programming languages. The ...
A system based on the notion of a flow graph is used to specify formally and to implement a compiler...