Lazy Type Inference for the Strictness Analysis of Lists

Chris Hankin, Daniel Le Métayer. Lazy Type Inference for the Strictness Analysis of Lists. In Donald Sannella, editor, Programming Languages and Systems - ESOP 94, 5th European Symposium on Programming, Edinburgh, U.K., April 11-13, 1994, Proceedings. Volume 788 of Lecture Notes in Computer Science, pages 257-271, Springer, 1994.

@inproceedings{HankinM94,
  title = {Lazy Type Inference for the Strictness Analysis of Lists},
  author = {Chris Hankin and Daniel Le Métayer},
  year = {1994},
  tags = {laziness, type inference, analysis},
  researchr = {https://researchr.org/publication/HankinM94},
  cites = {0},
  citedby = {0},
  pages = {257-271},
  booktitle = {Programming Languages and Systems - ESOP 94, 5th European Symposium on Programming, Edinburgh, U.K., April 11-13, 1994, Proceedings},
  editor = {Donald Sannella},
  volume = {788},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-57880-3},
}