Fall 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 from 11 am till noon 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. August 21 Opening Meeting UH 277 (Fishbowl)
1. August 28 TBA UH 277 (Fishbowl)
2. September 04 130k Lines of Formal Topology in Two Weeks: Simple and Cheap Autoformalization for Everyone? (Short Paper) UH 277 (Fishbowl)
3. September 11 An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on Finite Relations, Labelled Posets, and Parameterized Algebraic Theories UH 277 (Fishbowl)
4. September 18 POPE UH 277 (Fishbowl)
5. September 25 Reasoning about distributed reconfigurable systems UH 277 (Fishbowl)
6. October 02 Interaction Tree Semantics for RISC-V: Bridging Compiler and Hardware Verification UH 277 (Fishbowl)
7. October 09 On the minimal synchronism needed for distributed consensus UH 277 (Fishbowl)
8. October 16 A Survey of Two Verifiable Delay Functions Using Proof of Exponentiation UH 277 (Fishbowl)
9. October 23 Functional Reactive Programming, restated UH 277 (Fishbowl)
10. October 30 Formal verification of a realistic compiler UH 277 (Fishbowl)
11. November 06 Paper 10 discussion UH 277 (Fishbowl)
12. November 20 Awards Gala UH 277 (Fishbowl)

The week of November 13 is reserved for Awards Gala preparation.

Semester Papers

  1. Urban, Josef. “130k Lines of Formal Topology in Two Weeks: Simple and Cheap Autoformalization for Everyone? (Short Paper).” LIPIcs, Volume 382, ITP 2026, edited by Ekaterina Komendantskaya and Tobias Nipkow, vol. 382, no. 31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026, p. 31:1-31:9, https://doi.org/10.4230/LIPICS.ITP.2026.31.
  2. Kammar, Ohad, et al. “An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on Finite Relations, Labelled Posets, and Parameterized Algebraic Theories.” Proceedings of the ACM on Programming Languages, vol. 10, no. POPL, Jan. 2026, pp. 1847–75. Crossref, https://doi.org/10.1145/3776706.
  3. Roche, Daniel S., et al. “POPE.” Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, ACM, 24 Oct. 2016, CCS’16: 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1131–42. Crossref, https://doi.org/10.1145/2976749.2978345.
  4. Ahrens, Emma, et al. “Reasoning about Distributed Reconfigurable Systems.” Proceedings of the ACM on Programming Languages, vol. 6, no. OOPSLA2, Oct. 2022, pp. 145–74. Crossref, https://doi.org/10.1145/3563293.
  5. Kan, Shuanglong, and Sebastian Ertel. “Interaction Tree Semantics for RISC-V: Bridging Compiler and Hardware Verification.” Version 2, arXiv, 2026, https://doi.org/10.48550/arXiv.2605.04933.
  6. Dolev, Danny, et al. “On the Minimal Synchronism Needed for Distributed Consensus.” Journal of the ACM, vol. 34, no. 1, Jan. 1987, pp. 77–97. Crossref, https://doi.org/10.1145/7531.7533.
  7. Boneh, Dan, et al. “A Survey of Two Verifiable Delay Functions Using Proof of Exponentiation.” IACR Communications in Cryptology, Apr. 2024. Crossref, https://doi.org/10.62056/av7tudhdj.
  8. Chupin, Guerric, and Henrik Nilsson. “Functional Reactive Programming, Restated.” Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming, ACM, 7 Oct. 2019, PPDP ’19: Principles and Practice of Programming Languages 2019, pp. 1–14. Crossref, https://doi.org/10.1145/3354166.3354172.
  9. Leroy, Xavier. “Formal Verification of a Realistic Compiler.” Communications of the ACM, vol. 52, no. 7, July 2009, pp. 107–15. Crossref, https://doi.org/10.1145/1538788.1538814.