Spring 2026 Reading Group
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 at 3–4 pm in UH227 on Summerville Campus.
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.
Semester Schedule
| # | Date | Description | Location |
|---|---|---|---|
| 0. | January 9 | Planning Meeting | UH 117 (Palazzo) |
| 1. | January 23 | Robust Constant-Time Cryptography. | UH 314 |
| 2. | January 30 | Binary search—think positive | UH 227 (Fishbowl) |
| 3. | February 6 | Security Reasoning via Substructural Dependency Tracking | UH 227 (Fishbowl) |
| 4. | February 13 | Verified programming of Turing machines in Coq | UH 227 (Fishbowl) |
| 5. | February 20 | Logical relations for a logical framework | UH 227 (Fishbowl) |
| 6. | February 27 | Paper 6 discussion | UH 227 (Fishbowl) |
| 7. | March 13 | Paper 7 discussion | UH 227 (Fishbowl) |
| 8. | March 20 | Paper 8 discussion | UH 227 (Fishbowl) |
| 9. | March 27 | Paper 9 discussion | UH 227 (Fishbowl) |
| 10. | April 3 | Paper 10 discussion | UH 227 (Fishbowl) |
| 11. | April 10 | Paper 11 discussion | UH 227 (Fishbowl) |
| 12. | April 24 | Awards Gala | UH 227 (Fishbowl) |
No meetings March 6 (Spring Pause) and April 10 (Spring Break). The week of April 17 is reserved for awards gala preparation.
Semester Papers
- Kolosick, Matthew, et al. “Robust Constant-Time Cryptography.” Proceedings of the ACM on Programming Languages, vol. 9, no. PLDI, June 2025, pp. 1491–515. Crossref, https://doi.org/10.1145/3729310.
- DINGES, ALEXANDER, and RALF HINZE. “Binary Search—Think Positive.” Journal of Functional Programming, vol. 35, 2025. Crossref, https://doi.org/10.1017/S0956796825000061.
- Gouni, Hemant, et al. “Security Reasoning via Substructural Dependency Tracking.” Proceedings of the ACM on Programming Languages, vol. 10, no. POPL, Jan. 2026, pp. 777–805. Crossref, https://doi.org/10.1145/3776669.
- Forster, Yannick, et al. “Verified Programming of Turing Machines in Coq.” Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, ACM, 20 Jan. 2020, POPL ’20: 47th Annual ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 114–28. Crossref, https://doi.org/10.1145/3372885.3373816.
- Rabe, Florian, and Kristina Sojakova. “Logical Relations for a Logical Framework.” ACM Transactions on Computational Logic, vol. 14, no. 4, Nov. 2013, pp. 1–34. Crossref, https://doi.org/10.1145/2536740.2536741.