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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.