Runming Li

According to our database, Runming Li authored at least 8 papers between 2023 and 2026.

Collaborative distances:

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

2026

Big-Stop Semantics: Small-Step Semantics in a Big-Step Judgment.

David M. Kahn, Jan Hoffmann, Runming Li

Proc. ACM Program. Lang., 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

Mechanizing Synthetic Tait Computability in Istari.

Runming Li, Yue Yao, Robert Harper

Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2026

2025

Big-Stop Semantics: A Simple Way to Get the Benefits of Small-Step Semantics in a Big-Step Judgment.

David M. Kahn, Jan Hoffmann, Runming Li

CoRR, August, 2025

Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability.

Runming Li, Robert Harper

CoRR, April, 2025

Abstraction Functions as Types.

Harrison Grodin, Runming Li, Robert Harper

CoRR, February, 2025

2023

A Verified Cost Analysis of Joinable Red-Black Trees.

Runming Li, Harrison Grodin, Robert Harper

CoRR, 2023

What's in a Name? Linear Temporal Logic Literally Represents Time Lines.

Runming Li, Keerthana Gurushankar, Marijn J. H. Heule, Kristin Yvonne Rozier

Proceedings of the IEEE Working Conference on Software Visualization, 2023