Titlebook: Implementation of Functional Languages; 9th International Wo Chris Clack,Kevin Hammond,Tony Davie Conference proceedings 1998 Springer-Verl

上腭

A Haskell to Java Virtual Machine code compiler,aper describes our first attempt to produce a Haskell to Java Virtual Machine code compiler, based on a mapping between the G-machine and the Java Virtual Machine. Although this mapping looks good, it is not perfect, and our first results suggest that the compiled Java Virtual Machine code may be ra

薄膜

Common subexpressions are uncommon in lazy functional languages,ctional languages, referential transparency renders the identification of common subexpressions very simple. More common subexpressions can be recognised because they can be of arbitrary type whereas standard common subexpression elimination only shares primitive values. However, because lazy functi

共同给与

With-loop-folding in Sac-condensing consecutive array operations,C (for Single Assignment C) serves as a versatile vehicle to describe array operations on an elementwise basis. A general mechanism for combining two of these .-loops into a single loop construct is presented. This mechanism constitutes a powerful tool when it comes to generate efficiently executabl

泥瓦匠

STING

IRS

licence

justify

Complete and partial redex trails of functional computations,cer based on redex trails [8] demonstrated the promise of the technique, but was limited in two respects: (1) trails did not record every reduction, only those constructing a new value; (2) even so computing trails was very expensive, particularly in terms of the memory space they occupied. In this

粉笔

Parallelising a large functional program or: Keeping LOLITA busy,t parallelism, we believe that it is the largest parallel functional program ever, comprising more than 47,000 lines of Haskell. LOLITA has the following interesting features common to real world applications of lazy languages:.Our expectations in parallelising the program were to achieve moderate s

extemporaneous