Alan Jeffrey
Alan Jeffrey has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ben Greenman
University of Utah, Salt Lake City, USA
2 shared publications - Mitesh Shah
Roblox San Mateo CA USA
2 shared publications - Shriram Krishnamurthi
Brown University, Providence, USA
2 shared publications - Anton Podkopaev
Constructor University Bremen, Bremen, Germany
1 shared publication - Ilya Kaysin
JetBrains Research, Russia / University of Cambridge, UK
1 shared publication - James Riely
DePaul University, USA
1 shared publication
Latest Publications
- Open Access
Privacy-Respecting Type Error Telemetry at Scale
Context: Roblox Studio lets millions of creators build interactive experiences by programming in a variant of Lua called Luau. The creators form a broad group, ranging from novices writing their first script to professional developers; thus, Luau must support a wide audience. As part of its efforts to support all kinds of programmers, Luau includes an optional, gradual type system and goes to great lengths to minimize false positive errors. Inquiry: Since Luau is currently being used by many creators, we want to collect data to improve the language and, in particular, the type system. The standard way to collect data is to deploy client-side telemetry; however, we cannot scrape personal data or proprietary information, which means we cannot collect source code fragments, error messages, or even filepaths. The research questions are thus about how to conduct telemetry that is not invasive and obtain insights from it about type errors. Approach: We designed and implemented a pseudonymized, randomly-sampling telemetry system for Luau. Telemetry records include a timestamp, a session id, a reason for sending, and a numeric summary of the most recent type analyses. This information lets us study type errors over time without revealing private data. We deployed the system in Roblox Studio during Spring 2023 and collected over 1.5 million telemetry records from over 340,000 sessions. Knowledge: We present several findings about Luau, all of which suggest that telemetry is an effective way to study type error pragmatics. One of the less-surprising findings is that opt-in gradual types are unpopular: there is an 100x gap between the number of untyped Luau sessions and the number of typed ones. One surprise is that the strict mode for type analysis is overly conservative about interactions with data assets. A reassuring finding is that type analysis rarely hits its internal limits on problem size. Grounding: Our findings are supported by a dataset of over 1.5 million telemetry records. The data and scripts for analyzing it are available in an artifact. Importance: Beyond the immediate benefits to Luau, our findings about types and type errors have implications for adoption and ergonomics in other gradual languages such as TypeScript, Elixir, and Typed Racket. Our telemetry design is of broad interest, as it reports on type errors without revealing sensitive information.
Open AccessPrivacy-Respecting Type Error Telemetry at Scale
Context: Roblox Studio lets millions of creators build interactive experiences by programming in a variant of Lua called Luau. The creators form a broad group, ranging from novices writing their first script to professional developers; thus, Luau must support a wide audience. As part of its efforts to support all kinds of programmers, Luau includes an optional, gradual type system and goes to great lengths to minimize false positive errors. Inquiry: Since Luau is currently being used by many creators, we want to collect data to improve the language and, in particular, the type system. The standard way to collect data is to deploy client-side telemetry; however, we cannot scrape personal data or proprietary information, which means we cannot collect source code fragments, error messages, or even filepaths. The research questions are thus about how to conduct telemetry that is not invasive and obtain insights from it about type errors. Approach: We designed and implemented a pseudonymized, randomly-sampling telemetry system for Luau. Telemetry records include a timestamp, a session id, a reason for sending, and a numeric summary of the most recent type analyses. This information lets us study type errors over time without revealing private data. We deployed the system in Roblox Studio during Spring 2023 and collected over 1.5 million telemetry records from over 340,000 sessions. Knowledge: We present several findings about Luau, all of which suggest that telemetry is an effective way to study type error pragmatics. One of the less-surprising findings is that opt-in gradual types are unpopular: there is an 100x gap between the number of untyped Luau sessions and the number of typed ones. One surprise is that the strict mode for type analysis is overly conservative about interactions with data assets. A reassuring finding is that type analysis rarely hits its internal limits on problem size. Grounding: Our findings are supported by a dataset of over 1.5 million telemetry records. The data and scripts for analyzing it are available in an artifact. Importance: Beyond the immediate benefits to Luau, our findings about types and type errors have implications for adoption and ergonomics in other gradual languages such as TypeScript, Elixir, and Typed Racket. Our telemetry design is of broad interest, as it reports on type errors without revealing sensitive information.
- Open Access
- 15 February 2024
- Published by Aspect-Oriented Software Association (AOSA) in The Art, Science, and Engineering of Programming
- Vol. 8 (3) , 12:1-12:30
Privacy-Respecting Type Error Telemetry at Scale
Programming paper: Context: Roblox Studio lets millions of creators build interactive experiences by programming in a variant of Lua called Luau. The creators form a broad group, ranging from novices writing their first script to professional developers; thus, Luau must support a wide audience. As part of its effor...
- 15 February 2024
- Published by Aspect-Oriented Software Association (AOSA) in The Art, Science, and Engineering of Programming
- Vol. 8 (3) , 12:1-12:30
Open AccessPrivacy-Respecting Type Error Telemetry at Scale
Programming paper: Context: Roblox Studio lets millions of creators build interactive experiences by programming in a variant of Lua called Luau. The creators form a broad group, ranging from novices writing their first script to professional developers; thus, Luau must support a wide audience. As part of its effor...
- Open Access
- 12 January 2022
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 6 (POPL) , 1-30
The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency
Program logics and semantics tell a pleasant story about sequential composition: when executing (S1;S2), we first execute S1 then S2. To improve performance, however, processors execute instructions out of order, and compilers reorder programs even more dramatically. By design, single-threaded systems cannot observe these reorderings; however, multiple-threaded systems can, making the story considerably less pleasant. A formal attempt to understand the resulting mess is known as a “relaxed memory model.” Prior models either fail to address sequential composition directly, or overly restrict processors and compilers, or permit nonsense thin-air behaviors which are unobservable in practice. To support sequential composition while targeting modern hardware, we enrich the standard event-based approach with preconditions and families of predicate transformers. When calculating the meaning of (S1; S2), the predicate transformer applied to the precondition of an event e from S2 is chosen based on the set of events in S1 upon which e depends. We apply this approach to two existing memory models.
- 12 January 2022
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 6 (POPL) , 1-30
Open AccessThe leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency
Program logics and semantics tell a pleasant story about sequential composition: when executing (S1;S2), we first execute S1 then S2. To improve performance, however, processors execute instructions out of order, and compilers reorder programs even more dramatically. By design, single-threaded systems cannot observe these reorderings; however, multiple-threaded systems can, making the story considerably less pleasant. A formal attempt to understand the resulting mess is known as a “relaxed memory model.” Prior models either fail to address sequential composition directly, or overly restrict processors and compilers, or permit nonsense thin-air behaviors which are unobservable in practice. To support sequential composition while targeting modern hardware, we enrich the standard event-based approach with preconditions and families of predicate transformers. When calculating the meaning of (S1; S2), the predicate transformer applied to the precondition of an event e from S2 is chosen based on the set of events in S1 upon which e depends. We apply this approach to two existing memory models.
- 10 August 2004
- Published by Taylor & Francis
- p. 463-547
Matrices and linear transformations
The study of matrices that is developed in this chapter forms part of the branch of mathematics called linear algebra. A matrix is an array of quantities, usually numbers, but sometimes functions, in m rows and n columns. Systems of linear simultaneous equations can be expressed in matrix form and then manipulated as a single entity, and it is partly for this reason that matrices are so valuable in applications to engineering and science.
- 10 August 2004
- Published by Taylor & Francis
- p. 463-547
Matrices and linear transformations
The study of matrices that is developed in this chapter forms part of the branch of mathematics called linear algebra. A matrix is an array of quantities, usually numbers, but sometimes functions, in m rows and n columns. Systems of linear simultaneous equations can be expressed in matrix form and then manipulated as a single entity, and it is partly for this reason that matrices are so valuable in applications to engineering and science.
- 1 January 2004
- Published by Elsevier
- p. 353-368
Vector Analysis
- 1 January 2004
- Published by Elsevier
- p. 299-305
Laplace Transformation
- 1 January 2004
- Published by Elsevier
- p. 269-284
Bessel Functions
- 1 January 2004
- Published by Elsevier
- p. 25-99
Numerical, Algebraic, and Analytical Results for Series and Calculus
- 1 January 2004
- Published by Elsevier
- p. 25-99
Numerical, Algebraic, and Analytical Results for Series and Calculus
- 2 January 1995
- Published by Elsevier
- p. 363-373
Systems of Orthogonal Coordinates