Harrison Grodin

According to our database, Harrison Grodin authored at least 8 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Abstraction Functions as Types: Modular Verification of Cost and Behavior in Dependent Type Theory.

Harrison Grodin, Runming Li, Robert Harper

Proc. ACM Program. Lang., 2026

2025

Abstraction Functions as Types.

Harrison Grodin, Runming Li, Robert Harper

CoRR, February, 2025

2024

Decalf: A Directed, Effectful Cost-Aware Logical Framework.

Harrison Grodin, Yue Niu, Jonathan Sterling, Robert Harper

Proc. ACM Program. Lang., January, 2024

Amortized Analysis via Coalgebra.

Harrison Grodin, Robert Harper

Proceedings of the 40th Conference on the Mathematical Foundations of Programming Semantics, 2024

2023

A Verified Cost Analysis of Joinable Red-Black Trees.

Runming Li, Harrison Grodin, Robert Harper

CoRR, 2023

Amortized Analysis via Coinduction.

Harrison Grodin, Robert Harper

CoRR, 2023

Amortized Analysis via Coinduction (Early Ideas).

Harrison Grodin, Robert Harper

Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022

A cost-aware logical framework.

Yue Niu, Jonathan Sterling, Harrison Grodin, Robert Harper

Proc. ACM Program. Lang., 2022