Complete and easy bidirectional typechecking for higher-rank polymorphism

Joshua Dunfield, Neelakantan R. Krishnaswami. Complete and easy bidirectional typechecking for higher-rank polymorphism. In Greg Morrisett, Tarmo Uustalu, editors, ACM SIGPLAN International Conference on Functional Programming, ICFP'13, Boston, MA, USA - September 25 - 27, 2013. pages 429-442, ACM, 2013. [doi]

@inproceedings{DunfieldK13,
  title = {Complete and easy bidirectional typechecking for higher-rank polymorphism},
  author = {Joshua Dunfield and Neelakantan R. Krishnaswami},
  year = {2013},
  doi = {10.1145/2500365.2500582},
  url = {http://doi.acm.org/10.1145/2500365.2500582},
  researchr = {https://researchr.org/publication/DunfieldK13},
  cites = {0},
  citedby = {0},
  pages = {429-442},
  booktitle = {ACM SIGPLAN International Conference on Functional Programming, ICFP'13, Boston, MA, USA - September 25 - 27, 2013},
  editor = {Greg Morrisett and Tarmo Uustalu},
  publisher = {ACM},
  isbn = {978-1-4503-2326-0},
}