cs.AIJun 15, 2026

Symbolic Informalization: Fluent, Productive, Multilingual

Authors: Aarne Ranta

Organizations: Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg

Abstract

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.

Explore similar work

CardsList
  1. Pseudo-Formalization for Automatic Proof Verification

    May 19, 2026Slim Barkallah, Luke Bailey, Kaiyue Wen +2ProofFormalization