REVIEW 3 cited by
Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability
read the original abstract
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.
Forward citations
Cited by 3 Pith papers
-
Potential Functions as Types
Fracture-and-gluing equips every Calf computation type with an abstraction-plus-potential homomorphism so programs conserve potential and preserve abstraction; credits/debits and Giralf enable banker's-view programmin...
-
Directed proof-relevant logical relations in simplicial HoTT
Contravariant families in simplicial HoTT supply proof-relevant expansion, yielding directed Boolean canonicity and a binary parametricity model over reduction-aware syntax.
-
Potential Functions as Types
Every Calf type fuses an abstraction function with a potential function via fracture-and-gluing, so programs conserve potential and preserve abstraction; Giralf then enables automated credit-based inference.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.