Ben Greenman

Orcid: 0000-0001-7078-9287

Affiliations:
  • Brown University, Providence RI, USA


According to our database1, Ben Greenman authored at least 27 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
FlowFPX: Nimble Tools for Debugging Floating-Point Exceptions.
CoRR, 2024

Privacy-Respecting Type Error Telemetry at Scale.
CoRR, 2024

Conceptual Mutation Testing for Student Programming Misconceptions.
CoRR, 2024

2023
How Profilers Can Help Navigate Type Migration.
Proc. ACM Program. Lang., October, 2023

Rhombus: A New Spin on Macros without All the Parentheses.
Proc. ACM Program. Lang., October, 2023

How to Evaluate Blame for Gradual Types, Part 2.
Proc. ACM Program. Lang., August, 2023

Typed-Untyped Interactions: A Comparative Analysis.
ACM Trans. Program. Lang. Syst., March, 2023

Gradual Soundness: Lessons from Static Python.
Art Sci. Eng. Program., 2023

Little Tricky Logic: Misconceptions in the Understanding of LTL.
Art Sci. Eng. Program., 2023

Generating Programs Trivially: Student Use of Large Language Models.
Proceedings of the ACM Conference on Global Computing Education Vol 1, 2023

GTP Benchmarks for Gradual Typing Performance.
Proceedings of the 2023 ACM Conference on Reproducibility and Replicability, 2023

2022
Types for Tables: A Language Design Benchmark.
Art Sci. Eng. Program., 2022

A Transient Semantics for Typed Racket.
Art Sci. Eng. Program., 2022

Deep and shallow types for gradual languages.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Making Hay from Wheats: A Classsourcing Method to Identify Misconceptions.
Proceedings of the Koli Calling '22: 22nd Koli Calling International Conference on Computing Education Research, 2022

2021
How to evaluate blame for gradual types.
Proc. ACM Program. Lang., 2021

2020
Deep and shallow types.
PhD thesis, 2020

2019
Complete monitors for gradual types.
Proc. ACM Program. Lang., 2019

How to evaluate the performance of gradual type systems.
J. Funct. Program., 2019

2018
A spectrum of type soundness and performance.
Proc. ACM Program. Lang., 2018

Collapsible contracts: fixing a pathology of gradual typing.
Proc. ACM Program. Lang., 2018

On the cost of type-tag soundness.
Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2018

The behavior of gradual types: a user study.
Proceedings of the 14th ACM SIGPLAN International Symposium on Dynamic Languages, 2018

2017
Migratory Typing: Ten Years Later.
Proceedings of the 2nd Summit on Advances in Programming Languages, 2017

Type systems as macros.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

2016
Is sound gradual typing dead?
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2014
Getting F-bounded polymorphism into shape.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014


  Loading...