59 citations · 106 across the 9 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.PL2013
Annotations for Intersection Typechecking
Jana Dunfield
In functional programming languages, the classic form of annotation is a single type constraint on a term. Intersection types add complications: a single term may have to be checke…
cs.PL2013
Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
Jana Dunfield, Neelakantan R. Krishnaswami
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its scalability (unlike Damas-Milner type inference,…