Untrusted Authors, Trusted Answers: A Calculus of Fidelity-Graded Translations
Quick summary
arXiv:2607.14137v2 Announce Type: cross Abstract: To answer a question about a program, move the program to where the question is decidable. Every such move is a translation, and every translation is a place to be wrong. We study translation as a graph -- many languages, a few reasoning targets, independently built routes of honestly different trustworthiness -- and give it a calculus: pairs of languages close commuting squares that are directional (exactness is the identity-embedding special case of over-approximation), checkable per program, and composable, a route's contract being the compo
Key takeaways
- arXiv:2607.14137v2 Announce Type: cross Abstract: To answer a question about a program, move the program to where the question is decidable.
- Every such move is a translation, and every translation is a place to be wrong.
- We study translation as a graph -- many languages, a few reasoning targets, independently built routes of honestly different trustworthiness -- and give it a calculus: pairs of languages close commuting squares that are directional (exactness is the identity-embedding special case of over-approximation), checkable per program, and composable, a route's contract being the compo
Why it matters
The value of this work lies as much in how it was tested as in the claim itself. Sample design, baselines, uncertainty and replication help separate a laboratory result from real-world impact.