mlsanityData to 14 Oct 2026

Symbolic Informalization: Fluent, Productive, Multilingual

arXiv 2606.16893 ↗First posted 15 Jun 2026cs.AI cs.CL cs.LOcited by 0

Not on the map. Why?

Abstract (arXiv)

Symbolic informalization enables a reliable conversion of formal mathematics to natural language. It has the potential to make machine-checked content human-readable without loss of precision. In a traditional proof system usage, symbolic informalization generalizes the limited mechanisms of syntactic sugar into the ordinary language of mathematics. In a setting where proofs are constructed by artificial intelligence and autoformalization, symbolic informalization can explain what precisely has been constructed. This paper outlines the project Informath, which aims to show how symbolic informalization can produce fluent text with a reasonable development effort and address multiple formal and natural languages. Informath is based on an interlingual architecture, where Dedukti works as a hub between different proof systems (Agda, Lean, Rocq) and Grammatical Framework (GF) takes care of linguistic correctness and variation in different natural languages.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 57 references that are in the map. First posted on arXiv 15 Jun 2026.

Builds on

3 of 57 references.

References · 3

  1. 2018First Experiments with Neural Translation of Informal to Formal Mathematicscited by 53
  2. 2026130k Lines of Formal Topology in Two Weeks: Simple and Cheap Autoformalization for Everyone?cited by 18
  3. 2024GFLean: An Autoformalisation Framework for Lean via GFcited by 9

Built on by

Not cited yet.