Fall 2025 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 2–3 pm in UH 227 (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.

Semester Schedule

# Date Description Location
0. August 15 Neea’s defense JSAC 155
1. August 22 opening meeting UH117 (Palazzo)
2. August 29 Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems. UH227 (Fishbowl)
3. September 5 Generically Automating Separation Logic by Functors, Homomorphisms, and Modules. UH227 (Fishbowl)
4. September 12 Formalising Graph Algorithms with Coinduction. UH227 (Fishbowl)
5. September 19 An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model. UH227 (Fishbowl)
6. September 26 Paper 05 discussion UH227 (Fishbowl)
7. October 3 Paper 06 discussion UH227 (Fishbowl)
8. October 10 Fall pause  
9. October 17 Paper 07 discussion UH227 (Fishbowl)
10. October 24 Paper 08 discussion UH227 (Fishbowl)
11. October 31 🎃 Paper 09 discussion UH227 (Fishbowl)
12. November 7 Paper 10 discussion UH227 (Fishbowl)
13. November 22 Awards Gala UH227 (Fishbowl)

Semester Papers

  1. Ahrens, Emma, et al. Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, https://doi.org/10.4230/LIPICS.FSCD.2025.6.
  2. Xu, Qiyuan, et al. “Generically Automating Separation Logic by Functors, Homomorphisms, and Modules.” Proceedings of the ACM on Programming Languages, vol. 9, no. POPL, Jan. 2025, pp. 1992–2024. Crossref, https://doi.org/10.1145/3704903.
  3. Kidney, Donnacha Oisín, and Nicolas Wu. “Formalising Graph Algorithms with Coinduction.” Proceedings of the ACM on Programming Languages, vol. 9, no. POPL, Jan. 2025, pp. 1657–86. Crossref, https://doi.org/10.1145/3704892.
  4. El-Hayek, Antoine, et al. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 13 June 2025, pp. 532–40. PODC ’25: ACM Symposium on Principles of Distributed Computing, Crossref, https://doi.org/10.1145/3732772.3733505.