Is sound gradual typing dead? A Takikawa, D Feltey, B Greenman, MS New, J Vitek, M Felleisen Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016 | 149 | 2016 |
Getting F-bounded polymorphism into shape B Greenman, F Muehlboeck, R Tate ACM SIGPLAN Notices 49 (6), 89-99, 2014 | 58 | 2014 |
A spectrum of type soundness and performance B Greenman, M Felleisen Proceedings of the ACM on Programming Languages 2 (ICFP), 1-32, 2018 | 45 | 2018 |
Migratory typing: Ten years later S Tobin-Hochstadt, M Felleisen, R Findler, M Flatt, B Greenman, AM Kent, ... 2nd Summit on Advances in Programming Languages (SNAPL 2017), 2017 | 45 | 2017 |
On the cost of type-tag soundness B Greenman, Z Migeed Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program …, 2017 | 29 | 2017 |
Type systems as macros S Chang, A Knauth, B Greenman Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming …, 2017 | 29 | 2017 |
How to evaluate the performance of gradual type systems B Greenman, A Takikawa, MS New, D Feltey, RB Findler, J Vitek, ... Journal of Functional Programming 29, e4, 2019 | 28 | 2019 |
Collapsible contracts: fixing a pathology of gradual typing D Feltey, B Greenman, C Scholliers, RB Findler, V St-Amour Proceedings of the ACM on Programming Languages 2 (OOPSLA), 1-27, 2018 | 28 | 2018 |
The behavior of gradual types: A user study P Tunnell Wilson, B Greenman, J Pombrio, S Krishnamurthi Proceedings of the 14th ACM SIGPLAN International Symposium on Dynamic …, 2018 | 20 | 2018 |
Little Tricky Logic: Misconceptions in the Understanding of LTL B Greenman, S Saarinen, T Nelson, S Krishnamurthi arXiv preprint arXiv:2211.01677, 2022 | 13 | 2022 |
Complete monitors for gradual types B Greenman, M Felleisen, C Dimoulas Proceedings of the ACM on Programming Languages 3 (OOPSLA), 1-29, 2019 | 13 | 2019 |
How to evaluate blame for gradual types L Lazarek, B Greenman, M Felleisen, C Dimoulas Proceedings of the ACM on Programming Languages 5 (ICFP), 1-29, 2021 | 11 | 2021 |
Deep and Shallow Types B Greenman Northeastern University, 2020 | 11 | 2020 |
Gradual Soundness: Lessons from Static Python KC Lu, B Greenman, C Meyer, D Viehland, A Panse, S Krishnamurthi arXiv preprint arXiv:2206.13831, 2022 | 10 | 2022 |
A Transient Semantics for Typed Racket B Greenman, L Lazarek, C Dimoulas, M Felleisen The Art, Science, and Engineering of Programming 6 (2), 1--26, 2021 | 8 | 2021 |
Making Hay from Wheats: A Classsourcing Method to Identify Misconceptions S Prasad, B Greenman, T Nelson, J Wrenn, S Krishnamurthi Proceedings of the 22nd Koli Calling International Conference on Computing …, 2022 | 5 | 2022 |
Deep and Shallow Types for Gradual Languages B Greenman Proceedings of the 43rd ACM SIGPLAN International Conference on Programming …, 2022 | 5 | 2022 |
Generating Programs Trivially: Student Use of Large Language Models S Prasad, B Greenman, T Nelson, S Krishnamurthi Proceedings of the ACM Conference on Global Computing Education Vol 1, 126-132, 2023 | 4 | 2023 |
Typed–Untyped Interactions: A Comparative Analysis B Greenman, C Dimoulas, M Felleisen ACM Transactions on Programming Languages and Systems 45 (1), 1-54, 2023 | 4 | 2023 |
Types for Tables: A Language Design Benchmark KC Lu, B Greenman, S Krishnamurthi The Art, Science, and Engineering of Programming 6 (2), 1--30, 2021 | 3 | 2021 |