Programming Languages Reading Group
Fall 2024
Augusta University Programming Languages (PL) Reading Group is a regular meeting to discuss exciting recent results in programming languages research. The intent of the group is to learn about various ideas and generally broaden perspectives on PL research topics. We randomly select papers from the major PL conferences. At the end of the semester we gather for a lively discussion to give prestigious awards to select papers.
We meet weekly on Fridays, 2-3 pm in room UH 117 (Summerville).
We encourage everyone to join our reading group. Even if your primary focus is not PL, this is a chance to learn about various new topics that may become relevant to you later. It is also simply fun to hang out with us.
The PL Reading Group is a regular meeting of ΔΛΔ student organization.
Our tools for paper selection: plgroup on Github.
Semester Schedule
| # | Date | Description |
|---|---|---|
| 0. | August 16 | Kick-off meeting |
| 1. | August 30 | Numerical Fuzz: A Type System for Rounding Error Analysis |
| 2. | September 6 | Simple Reference Immutability for System F <: |
| 3. | September 13 | Polymorphic Type Inference for Dynamic Languages |
| 4. | September 20 | A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized |
| 5. | September 27 | ⚠️ meeting canceled for Hurricane Helene |
| 6. | October 4 | ⚠️ meeting canceled for storm recovery and campus closure |
| 7. | October 18 | Fat Pointers for Temporal Memory Safety of C |
| 8. | October 25 | A Pretty Expressive Printer |
| 9. | November 1 | Spirea: A Mechanized Concurrent Separation Logic for Weak Persistent Memory |
| 10. | November 8 | Parikh’s Theorem Made Symbolic |
| 11. | November 22 | Fall Finale and Awards Gala |
No meeting on August 23, October 11 (fall pause), and November 15.
The weeks of November 8–22 are reserved for preparing for the awards discussion.
Semester Papers
- Kellison, Ariel E., and Justin Hsu. “Numerical Fuzz: A Type System for Rounding Error Analysis.” Proceedings of the ACM on Programming Languages, vol. 8, no. PLDI, June 2024, pp. 1954–78. Crossref, https://doi.org/10.1145/3656456.
- Lee, Edward, and Ondřej Lhoták. “Simple Reference Immutability for System F <:” Proceedings of the ACM on Programming Languages, vol. 7, no. OOPSLA2, Oct. 2023, pp. 857–81. Crossref, https://doi.org/10.1145/3622828.
- Castagna, Giuseppe, et al. “Polymorphic Type Inference for Dynamic Languages.” Proceedings of the ACM on Programming Languages, vol. 8, no. POPL, Jan. 2024, pp. 1179–210. Crossref, https://doi.org/10.1145/3632882.
- Abel, Andreas, et al. “A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized.” Proceedings of the ACM on Programming Languages, vol. 7, no. ICFP, Aug. 2023, pp. 920–54. Crossref, https://doi.org/10.1145/3607862.
- Zhou, Jie, et al. “Fat Pointers for Temporal Memory Safety of C.” Proceedings of the ACM on Programming Languages, vol. 7, no. OOPSLA1, Apr. 2023, pp. 316–47. Crossref, https://doi.org/10.1145/3586038.
- Porncharoenwase, Sorawee, et al. “A Pretty Expressive Printer.” Proceedings of the ACM on Programming Languages, vol. 7, no. OOPSLA2, Oct. 2023, pp. 1122–49. Crossref, https://doi.org/10.1145/3622837.
- Vindum, Simon Friis, and Lars Birkedal. “Spirea: A Mechanized Concurrent Separation Logic for Weak Persistent Memory.” Proceedings of the ACM on Programming Languages, vol. 7, no. OOPSLA2, Oct. 2023, pp. 632–57. Crossref, https://doi.org/10.1145/3622820.
- Hague, Matthew, et al. “Parikh’s Theorem Made Symbolic.” Proceedings of the ACM on Programming Languages, vol. 8, no. POPL, Jan. 2024, pp. 1945–77. Crossref, https://doi.org/10.1145/3632907.
Awards
New Awards Procedure (Fall 2024)
At the end of the semester, each participant nominates any number of papers which they believe should receive an award. Additionally, for each paper nominated, the participant picks two papers they believe should not receive awards.
The awards gala, then consists of arguing if the nominated papers should receive awards, and coming up with funny award names for the winners.
Awards:
Cthulhu’s Diary. This award is for the paper that presents the reader with machinations uncomprehensible in the human mind, that of which is likens to Lovecraftian horrors of a different age. Winner: A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized
The Librarian. This award is for the paper that, like a librarian, shows unmatched dedication to their bookkeeping and organization of resources. Specifically, this is for the paper with the most comprehensive, well-formatted, and organized paper of the semester. Winner: Polymorphic Type Inference for Dynamic Languages
Exchange French. Like a game of chess, the awarded paper’s authors displays a profound sense of skill in how it opens the paper, giving a grand introduction to the concepts that lie beyond it. Winner: Polymorphic Type Inference for Dynamic Languages
The NASA Award. This award is for the paper that goes above and beyond the realm of progress in it’s own, niche field. Like the astronauts that traveled to the moon, this paper singlehandedly propels the research in it’s field forward. Winner: A Pretty Expressive Printer
Distinguished Spirit Award. This award is for the member who showed a profound sense of commitment to the papers we read and the meetings we held, showing exceptional spirit and vigor when discussing each paper. Winner: Peter Hanukaev
