TIM: A simple, lazy abstract machine to execute supercombinatorics

Jon Fairbairn, Stuart Wray. TIM: A simple, lazy abstract machine to execute supercombinatorics. In Gilles Kahn, editor, Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, September 14-16, 1987, Proceedings. Volume 274 of Lecture Notes in Computer Science, pages 34-45, Springer, 1987.

@inproceedings{FairbairnW87,
  title = {TIM: A simple, lazy abstract machine to execute supercombinatorics},
  author = {Jon Fairbairn and Stuart Wray},
  year = {1987},
  tags = {laziness, abstract machine},
  researchr = {https://researchr.org/publication/FairbairnW87},
  cites = {0},
  citedby = {0},
  pages = {34-45},
  booktitle = {Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, September 14-16, 1987, Proceedings},
  editor = {Gilles Kahn},
  volume = {274},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-18317-5},
}