There is a growing interest nowadays in functional programming languages and systems, and in special hardware for executing them. Many of these implementations are based on a system called graph reduction (GR), in which a program is represented as a graph which is transformed, or reduced, by the machine until it represents the desired answer. The various graph reduction implementations differ in the structure of the "machine code " (the program graph
We describe in this paper a graph narrowing machine that has been designed for the implementation of...
We identify a set of programming constructs ensuring that a programming language based on graph tra...
SIGLEAvailable from British Library Document Supply Centre- DSC:D90269 / BLDSC - British Library Doc...
Combinators are shown to provide a very suitable basis for implementations of functional and symboli...
We describe the use and distributed implementation of a functional language based on the graph-reduc...
Graph reduction is one of the important evaluation strategy for lazy functional Programming. A combi...
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs ...
AbstractThis paper presents a formal development, employing techniques of transformational programmi...
A language for a parallel, logic graph reduction system is described in this dissertation. The langu...
2.95SIGLELD:8671.22(PRG--28) / BLDSC - British Library Document Supply CentreGBUnited Kingdo
The performance of program-derived combinator graph reduction is known to be superior to that of gra...
Journal ArticleThis paper describes an effective means for programming shared memory multiprocessors...
This paper describes a computer architecture for execution of lazy functional languages. The archite...
In M. Wand (1982, in “Conf. Rec. 9th ACM Sympos. on Principles of Programming Languages,” pp. 234–24...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
We describe in this paper a graph narrowing machine that has been designed for the implementation of...
We identify a set of programming constructs ensuring that a programming language based on graph tra...
SIGLEAvailable from British Library Document Supply Centre- DSC:D90269 / BLDSC - British Library Doc...
Combinators are shown to provide a very suitable basis for implementations of functional and symboli...
We describe the use and distributed implementation of a functional language based on the graph-reduc...
Graph reduction is one of the important evaluation strategy for lazy functional Programming. A combi...
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs ...
AbstractThis paper presents a formal development, employing techniques of transformational programmi...
A language for a parallel, logic graph reduction system is described in this dissertation. The langu...
2.95SIGLELD:8671.22(PRG--28) / BLDSC - British Library Document Supply CentreGBUnited Kingdo
The performance of program-derived combinator graph reduction is known to be superior to that of gra...
Journal ArticleThis paper describes an effective means for programming shared memory multiprocessors...
This paper describes a computer architecture for execution of lazy functional languages. The archite...
In M. Wand (1982, in “Conf. Rec. 9th ACM Sympos. on Principles of Programming Languages,” pp. 234–24...
Combinatorial algorithms have long played apivotal enabling role in many applications of parallel co...
We describe in this paper a graph narrowing machine that has been designed for the implementation of...
We identify a set of programming constructs ensuring that a programming language based on graph tra...
SIGLEAvailable from British Library Document Supply Centre- DSC:D90269 / BLDSC - British Library Doc...