Lazy rewriting and eager machinery

This publication has 16 references indexed in Scilit:

• CONS should not CONS its arguments, part II
  ACM SIGPLAN Notices, 1995
• On the adequacy of graph rewriting for simulating term rewriting
  ACM Transactions on Programming Languages and Systems, 1994
• Call-by-need and continuation-passing style
  Higher-Order and Symbolic Computation, 1994
• Abstract rewriting
  Published by Springer Nature ,1993
• Compiling conditional rewriting systems
  Published by Springer Nature ,1988
• Tim: A simple, lazy abstract machine to execute supercombinators
  Published by Springer Nature ,1987
• Term graph rewriting
  Published by Springer Nature ,1987
• The theory and practice of transforming call-by-need into call-by-value
  Published by Springer Nature ,1980
• Call-by-name, call-by-value and the λ-calculus
  Theoretical Computer Science, 1975
• Thunks
  Communications of the ACM, 1961