59 citations · 106 across the 9 of their papers we have counts for
3 papers · 1 filter
Sums of Uncertainty: Refinements Go Gradual
Khurram A. Jafery, Jana Dunfield
A long-standing shortcoming of statically typed functional languages is that type checking does not rule out pattern-matching failures (run-time match exceptions). Refinement types…
Refinement types for precisely named cache locations
Matthew A. Hammer, Jana Dunfield, Dimitrios J. Economou +1
Many programming language techniques for incremental computation employ programmer-specified names for cached information. At runtime, each name identifies a "cache location" for a…
Sound and Complete Bidirectional Typechecking for Higher-Rank Polymorphism with Existentials and Indexed Types
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 applicability to a variety of type systems, its…