Biparsers: Exact Printing for Data Synchronisation
summary
Claims a first biparser framework that achieves exact-printing with non-injective parsers by treating parser/printer pairs as monadic lenses, proving round‑trip properties and a composition law that preserves them. Provides a combinator library and handles backtracking choice with special preconditions, ships mechanized proofs in Agda and a runnable Haskell library, and includes reusable examples for subsets of JSON/YAML. Artifacts are evaluated and reusable, so the implementation and proofs actually work end‑to‑end.
AI-written summary · about