Call-by-need and continuation-passing style

This publication has 21 references indexed in Scilit:

• Representing Control: a Study of the CPS Transformation
  Mathematical Structures in Computer Science, 1992
• Cache behavior of combinator graph reduction
  ACM Transactions on Programming Languages and Systems, 1992
• Generating a compiler for a lazy language by partial evaluation
  Published by Association for Computing Machinery (ACM) ,1992
• The semantics of lazy functional languages
  Theoretical Computer Science, 1989
• Continuation-passing, closure-passing style
  Published by Association for Computing Machinery (ACM) ,1989
• Code optimizations for lazy evaluation
  Higher-Order and Symbolic Computation, 1988
• Detecting sharing of partial applications in functional programs
  Published by Springer Nature ,1987
• Strictness analysis for higher-order functions
  Science of Computer Programming, 1986
• Lambda lifting: Transforming programs to recursive equations
  Published by Springer Nature ,1985
• The theory and practice of transforming call-by-need into call-by-value
  Published by Springer Nature ,1980