## AbstractBidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its scalability, its error reporting, and its ease of implementation. Following principles from proof theory, bidirectional typing can be applied to many type constructs. The principles underlying a bidirectional approach to indexed types ( |

- Paper + proofs (23 + 144 pages)

- Paper (13 pages)
- Omitted figures, lemmas and proofs (157 pages)

@Unpublished{Dunfield16:gadts, author = {Joshua Dunfield and Neelakantan R. Krishnaswami}, title = {Sound and Complete Bidirectional Typechecking for Higher-Rank Polymorphism with Existentials and Indexed Types}, month = jan, year = {2016}, note = {\url{http://arxiv.org/abs/1601.05106}} }

all papers * related papers

Joshua Dunfield