Complete and easy bidirectional typechecking for higher-rank polymorphism

DOI10.1145/2500365.2500582zbMath1323.68204arXiv1306.6032OpenAlexW2076653850MaRDI QIDQ5244821

Joshua Dunfield, Neelakantan R. Krishnaswami

Publication date: 30 March 2015

Published in: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.6032

zbMATH Keywords

higher-rank polymorphismbidirectional typechecking

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Existential type systems between Church and Curry style (type-free style) ⋮ Constraint handling rules with binders, patterns and generic quantification ⋮ Doo bee doo bee doo ⋮ Extensible Datasort Refinements ⋮ Visible Type Application ⋮ COCHIS: Stable and coherent implicits

This page was built for publication: Complete and easy bidirectional typechecking for higher-rank polymorphism