Efficient Type Inference for Higher-Order Binding-Time Analysis

Fritz Henglein. Efficient Type Inference for Higher-Order Binding-Time Analysis. In John Hughes, editor, Functional Programming Languages and Computer Architecture, 5th ACM Conference, Cambridge, MA, USA, August 26-30, 1991, Proceedings. Volume 523 of Lecture Notes in Computer Science, pages 448-472, Springer, 1991. [doi]

@inproceedings{Henglein91,
  title = {Efficient Type Inference for Higher-Order Binding-Time Analysis},
  author = {Fritz Henglein},
  year = {1991},
  url = {http://www.springerlink.com/content/y255468h30456660/},
  tags = {type inference, rule-based, program analysis, variable binding, refinement, analysis, constraints, type system, binding-time, rules, transformation system, e-science, compiler, context-aware, higher-order transformations, transformation, program transformation},
  researchr = {https://researchr.org/publication/Henglein91},
  cites = {0},
  citedby = {0},
  pages = {448-472},
  booktitle = {Functional Programming Languages and Computer Architecture, 5th ACM Conference, Cambridge, MA, USA, August 26-30, 1991, Proceedings},
  editor = {John Hughes},
  volume = {523},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-54396-1},
}