40.2k citations
- Max Planck SocietyDE68 papers
- University of OxfordGB25 papers
- Centre National de la Recherche ScientifiqueFR24 papers
- Saarland UniversityDE17 papers
- University of CambridgeGB12 papers
- ETH ZurichCH11 papers
- IMDEA Software InstituteES10 papers
- Indian Institute of Technology KharagpurIN10 papers
- University of California, Los AngelesUS10 papers
- Max Planck Institute for InformaticsDE9 papers
- National University of SingaporeSG9 papers
- Newcastle UniversityGB9 papers
Showing 2013 · cs.PLShow all
2 papers · 2 filters
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,…