| Equality saturation: a new approach to optimization R Tate, M Stepp, Z Tatlock, S Lerner Principles of Programming Languages 44 (1), 264-276, 2009 | 330 | 2009 |
| Equality-based translation validator for LLVM M Stepp, R Tate, S Lerner Computer Aided Verification: 23rd International Conference, CAV 2011 …, 2011 | 84 | 2011 |
| Java and Scala's type systems are unsound: the existential crisis of null pointers N Amin, R Tate Acm Sigplan Notices 51 (10), 838-848, 2016 | 72 | 2016 |
| Getting F-bounded polymorphism into shape B Greenman, F Muehlboeck, R Tate Proceedings of the 35th ACM SIGPLAN Conference on Programming Language …, 2014 | 58 | 2014 |
| Sound gradual typing is nominally alive and well F Muehlboeck, R Tate Proceedings of the ACM on Programming Languages 1 (OOPSLA), 1-30, 2017 | 56 | 2017 |
| The Sequential Semantics of Producer Effect Systems R Tate Principles of Programming Languages 48 (1), 2013 | 48 | 2013 |
| Generating compiler optimizations from proofs R Tate, M Stepp, S Lerner Principles of Programming Languages 45 (1), 389-402, 2010 | 42 | 2010 |
| Taming wildcards in Java's type system R Tate, A Leung, S Lerner Programming Language Design and Implementation, 614-627, 2011 | 36 | 2011 |
| Empowering union and intersection types with integrated subtyping F Muehlboeck, R Tate Proceedings of the ACM on Programming Languages 2 (OOPSLA), 1-29, 2018 | 31 | 2018 |
| Inferable object-oriented typed assembly language R Tate, J Chen, C Hawblitzel Programming Language Design and Implementation 45 (6), 424-435, 2010 | 16 | 2010 |
| World age in Julia: optimizing method dispatch in the presence of eval J Belyakova, B Chung, J Gelinas, J Nash, R Tate, J Vitek Proceedings of the ACM on Programming Languages 4 (OOPSLA), 1-26, 2020 | 14 | 2020 |
| Mixed-Site Variance R Tate | 13 | 2013 |
| Type stability in Julia: avoiding performance pathologies in JIT compilation A Pelenitsyn, J Belyakova, B Chung, R Tate, J Vitek Proceedings of the ACM on Programming Languages 5 (OOPSLA), 1-26, 2021 | 12 | 2021 |
| The Effects of Effects on Constructivism L Cohen, SA Faro, R Tate Electronic Notes in Theoretical Computer Science 347, 87-120, 2019 | 10 | 2019 |
| Transitioning from structural to nominal code with efficient gradual typing F Muehlboeck, R Tate Proceedings of the ACM on Programming Languages 5 (OOPSLA), 1-29, 2021 | 8 | 2021 |
| Convenient explicit effects using type inference with subeffects R Tate, D Leijen Technical Report MSR-TR-2010-80, Microsoft Research, 2010 | 7 | 2010 |
| Translating between PEGs and CFGs R Tate, M Stepp, Z Tatlock, S Lerner Technical Report CS2008-0931, University of California, San Diego, 2008 | 6 | 2008 |
| First-Order Logic for Flow-Limited Authorization AK Hirsch, PHA de Amorim, E Cecchetti, R Tate, O Arden 2020 IEEE 33rd Computer Security Foundations Symposium (CSF), 123-138, 2020 | 5 | 2020 |
| Preventing glitches and short circuits in high-level self-timed chip specifications S Longfield, B Nkounkou, R Manohar, R Tate ACM SIGPLAN Notices 50 (6), 270-279, 2015 | 5 | 2015 |
| Evidenced Frames: A Unifying Framework Broadening Realizability Models L Cohen, É Miquey, R Tate 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021 | 4 | 2021 |
Zachary TatlockUniversity of WashingtonVerified email at cs.washington.edu
