Add to ORKGTwo mappings from attribute grammars to lazy functional programs are defined. One of these mappings is an efficient implementation of attribute grammars. The other mapping yields inefficient programs. It is shown how some transformations of functional programs may be better understood by viewing the programs as inefficient implementations of attribute grammars
Attributed grammars can be used to specify both the syntax and the semantics of programming language...
What is the practical applicability of attribute grammars? As we show in this paper, attribute gramm...
Projet OSCARThe deforestation of a functional program is a transformation which gets rid ofintermedi...
technical reportAn attribute grammar combines the standard context-free grammar that defines the syn...
For long, attribute grammars have formed an isolated programming formal-ism. We show how we may embe...
In this paper we present a new programming technique for lazy functional programming languages. The ...
Associated research group: Minnesota Extensible Language ToolsWhile attribute grammars (AGs) have se...
AbstractIn this paper we present a new programming technique for lazy functional programming languag...
Attribute grammars are a suitable formalism to express complex software language analysis and manipu...
Automatic optimizers for computer programs work with a fixed list of rote transformations, while hu...
Software engineering has to reconcile modularity, that is required for development and maintenance p...
AbstractWe describe an algorithm for abstract interpretation of an intermediate language in a Haskel...
Our goal is to develop a new and highly flexible approach to program optimization. Instead of apply...
We describe an algorithm for abstract interpretation of an intermediate language in a Haskell compil...
Tupling of function results is a well-known technique in functional programming to avoid multiple tr...
Attributed grammars can be used to specify both the syntax and the semantics of programming language...
What is the practical applicability of attribute grammars? As we show in this paper, attribute gramm...
Projet OSCARThe deforestation of a functional program is a transformation which gets rid ofintermedi...
technical reportAn attribute grammar combines the standard context-free grammar that defines the syn...
For long, attribute grammars have formed an isolated programming formal-ism. We show how we may embe...
In this paper we present a new programming technique for lazy functional programming languages. The ...
Associated research group: Minnesota Extensible Language ToolsWhile attribute grammars (AGs) have se...
AbstractIn this paper we present a new programming technique for lazy functional programming languag...
Attribute grammars are a suitable formalism to express complex software language analysis and manipu...
Automatic optimizers for computer programs work with a fixed list of rote transformations, while hu...
Software engineering has to reconcile modularity, that is required for development and maintenance p...
AbstractWe describe an algorithm for abstract interpretation of an intermediate language in a Haskel...
Our goal is to develop a new and highly flexible approach to program optimization. Instead of apply...
We describe an algorithm for abstract interpretation of an intermediate language in a Haskell compil...
Tupling of function results is a well-known technique in functional programming to avoid multiple tr...
Attributed grammars can be used to specify both the syntax and the semantics of programming language...
What is the practical applicability of attribute grammars? As we show in this paper, attribute gramm...
Projet OSCARThe deforestation of a functional program is a transformation which gets rid ofintermedi...