Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability
By: Runming Li, Robert Harper
Potential Business Impact:
Proves a math idea to make computer costs clear.
In the original work on the cost-aware logical framework by Niu et al., a dependent variant of the call-by-push-value language for cost analysis, the authors conjectured that the canonicity property of the type theory can be succinctly proved via Sterling's synthetic Tait computability. This work resolves the conjecture affirmatively.
Similar Papers
Mechanizing Synthetic Tait Computability in Istari
Programming Languages
Makes computer proofs correct and easier.
Resource-Bounded Type Theory: Compositional Cost Analysis via Graded Modalities
Logic in Computer Science
Guarantees computer programs won't run too long.
Canonical for Automated Theorem Proving in Lean
Logic in Computer Science
Finds math proofs and makes computer programs.