Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs (Q1098614): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3685171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The next 700 programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial parametrization eliminates multiple traversals of data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new implementation technique for applicative languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721784 / rank
 
Normal rank

Latest revision as of 15:06, 18 June 2024

scientific article
Language Label Description Also known as
English
Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
scientific article

    Statements

    Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs (English)
    0 references
    0 references
    1988
    0 references
    Lambda-hoisting is a technique for transforming functional programs into ones suitable for fully lazy evaluation. The proposed method has a great advantage in generating efficient code for conventional computers. The basic idea of lambda-hoisting is described with remarks on similar techniques, and a simple algorithm is presented in a formal way.
    0 references
    program transformation
    0 references
    Lambda-hoisting
    0 references
    functional programs
    0 references
    fully lazy evaluation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references