Kenneth R. Traub

Learn More
Although they are powerful intermediate representations for compilers, pure dataflow graphs are incomplete, and perhaps even undesirable, machine languages. They are incomplete because it is hard to encode critical sections and imperative operations which are essential for the efficient execution of operating system functions, such as resource management.(More)
In this paper we present a new solution to the problem of compiling an eager, non-strict language into multiple sequential threads. The solution is described using an intermediate program form developed for the programming language Id [Nik90], a functional language extended with I-structures [ANP86] and M-structures [BNA91]. A similar intermediate form has(More)
Although they are powerful intermediate representations for compilers, pure dataaow graphs are incomplete, and perhaps even undesirable, machine languages. They are incomplete because it is hard to encode critical sections and imperative operations which are essential for the eecient execution of operating system functions, such as resource management. They(More)
An implementation technique for functional languages that has rcceived recent attention is graph reduction, which offers opportuniqt for the exploitation of parallelism by multiple processors. While several proposals for parallel graph reduction machines have been made, differing terminology and approaches make these proposals dimcuk to compare. This paper(More)
  • 1