By date (recent first); By subject
|
Dimitrios J. Economou Neel Krishnaswami Jana Dunfield |
Focusing on Refinement Typing
ACM Transactions on Programming Languages and Systems, June 2023 |
|
|
Jana Dunfield Neel Krishnaswami |
Bidirectional typing
ACM Computing Surveys, May 2021 |
|
|
Jana Dunfield Neel Krishnaswami |
Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types
January 2019 |
|
|
Matthew A. Hammer Jana Dunfield Kyle Headley Monal Narasimhamurthy Dimitrios J. Economou |
Fungi: Typed incremental computation with names
July 2018 |
|
| Jana Dunfield |
Extensible datasort refinements
ESOP ’17, April 2017, Uppsala |
|
||
|
Khurram A. Jafery Jana Dunfield |
Sums of Uncertainty: Refinements go gradual
POPL ’17, January 2017, Paris |
|
|
Matthew A. Hammer Jana Dunfield Kyle Headley Nicholas Labich Jeffrey S. Foster Michael Hicks David Van Horn |
Incremental computation with names
OOPSLA ’15, October 2015, Pittsburgh |
|
|||
| Jana Dunfield |
Elaborating evaluation-order polymorphism
ICFP ’15, August 2015, Vancouver |
|
| Jana Dunfield |
Elaborating intersection and union types
Journal of Functional Programming, May 2014 |
|
|
|
Yan Chen Jana Dunfield Matthew A. Hammer Umut A. Acar |
Implicit self-adjusting computation for purely functional programs
Journal of Functional Programming, January 2014 |
|
|
Jana Dunfield Neel Krishnaswami |
Complete and easy bidirectional typechecking for higher-rank polymorphism
ICFP ’13, September 2013, Boston |
|
| Jana Dunfield |
Elaborating intersection and union types
ICFP ’12, September 2012, Copenhagen |
|
|||
| Jana Dunfield |
Annotations for intersection typechecking
ITRS ’12, June 2012, Dubrovnik; post-proceedings version to appear in EPTCS |
|
|||
|
Yan Chen Jana Dunfield Umut A. Acar |
Type-directed automatic incrementalization
PLDI ’12, June 2012, Beijing |
|
|
Yan Chen Jana Dunfield Matthew A. Hammer Umut A. Acar |
Implicit self-adjusting computation for purely functional programs
ICFP ’11, September 2011, Tokyo |
|
|
Brigitte Pientka Jana Dunfield |
Covering all bases: design and implementation of case analysis for contextual objects
October 2010 |
|
||
|
Brigitte Pientka Jana Dunfield |
Beluga: a framework for programming and reasoning with deductive systems (system description)
IJCAR ’10, July 2010, Edinburgh |
|
||
| Jana Dunfield |
Untangling typechecking of intersections and unions
ITRS ’10, July 2010, Edinburgh; post-proceedings version in EPTCS 45, Jan. 2011 |
|
| Jana Dunfield |
Greedy bidirectional polymorphism
ML Workshop, August 2009, Edinburgh |
|
||
| Jana Dunfield |
Bidirectional polymorphism through greed and unions
March 2009 |
|
|
Brigitte Pientka Jana Dunfield |
Programming with proofs and explicit contexts
PPDP ’08, July 2008, Valencia |
|
||
|
Jana Dunfield Brigitte Pientka |
Case analysis of higher-order data
LFMTP ’08, June 2008, Pittsburgh |
|
| Jana Dunfield |
Refined typechecking with Stardust
PLPV ’07, October 2007, Freiburg |
|
||
| Jana Dunfield |
A unified system of type refinements
Doctoral dissertation, August 2007 |
|
||
| Jana Dunfield |
Applying type refinements
Student Seminar Series talk, May 2005 |
|
||
|
Jana Dunfield Frank Pfenning |
Tridirectional typechecking (extended version)
March 2004 |
|
||
| Jana Dunfield |
Unifying principles of type refinements
February 2004 |
|
||
|
Jana Dunfield Frank Pfenning |
Tridirectional typechecking
POPL ’04, January 2004, Venice |
|
||
|
Jana Dunfield Frank Pfenning |
Type assignment for intersections and unions in call-by-value languages
FOSSACS ’03, April 2003, Warsaw |
|
||
| Jana Dunfield |
Combining two forms of type refinements
September 2002 |
|
| slides | video |
| unrefereed manuscript | technical report | unrefereed workshop paper |
| dissertation | refereed conference or workshop paper | |
| journal paper |
| Jana Dunfield Aleksey Kliger |
Tail call optimization in SUIF April 2003 |
|