| 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 | 161 | 2016 |
| Getting F-bounded polymorphism into shape B Greenman, F Muehlboeck, R Tate ACM SIGPLAN Notices 49 (6), 89-99, 2014 | 58 | 2014 |
| 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 | 51 | 2017 |
| A spectrum of type soundness and performance B Greenman, M Felleisen Proceedings of the ACM on Programming Languages 2 (ICFP), 1-32, 2018 | 50 | 2018 |
| 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 | 34 | 2019 |
| Type systems as macros S Chang, A Knauth, B Greenman Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming …, 2017 | 34 | 2017 |
| 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 | 32 | 2018 |
| On the cost of type-tag soundness B Greenman, Z Migeed Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program …, 2017 | 32 | 2017 |
| 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 | 28 | 2018 |
| Little Tricky Logic: Misconceptions in the Understanding of LTL B Greenman, S Saarinen, T Nelson, S Krishnamurthi arXiv preprint arXiv:2211.01677, 2022 | 26 | 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 | 16 | 2023 |
| 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 | 15 | 2021 |
| Complete monitors for gradual types B Greenman, M Felleisen, C Dimoulas Proceedings of the ACM on Programming Languages 3 (OOPSLA), 1-29, 2019 | 15 | 2019 |
| Gradual Soundness: Lessons from Static Python KC Lu, B Greenman, C Meyer, D Viehland, A Panse, S Krishnamurthi arXiv preprint arXiv:2206.13831, 2022 | 12 | 2022 |
| Deep and Shallow Types B Greenman Northeastern University, 2020 | 12 | 2020 |
| 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 | 10 | 2021 |
| Deep and Shallow Types for Gradual Languages B Greenman Proceedings of the 43rd ACM SIGPLAN International Conference on Programming …, 2022 | 9 | 2022 |
| Forge: A Tool and Language for Teaching Formal Methods T Nelson, B Greenman, S Prasad, T Dyer, E Bove, Q Chen, C Cutting, ... Proceedings of the ACM on Programming Languages 8 (OOPSLA1), 613-641, 2024 | 7 | 2024 |
| GTP Benchmarks for Gradual Typing Performance B Greenman Proceedings of the 2023 ACM Conference on Reproducibility and Replicability …, 2023 | 6 | 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 | 6 | 2023 |
Matthias FelleisenTrustee Professor of Computer Science, Northeastern Universityfelleisen.org의 이메일 확인됨