agda

The paper addresses tokenization errors in large language models when applied to Brahmic scripts by formalizing orthographic constraints in Agda and developing a provably correct fix for tokenization, with practical implementations in SentencePiece and a Rust library.

This paper presents a case study in reformalization, transferring the Jordan Curve Theorem between proof assistants (Mizar to Lean, HOL Light to Lean and Agda) using LLMs, and analyzes pipeline design choices for practical reformalization.

A detailed blog post presenting a fully commented proof of the Fundamental Theorem of Arithmetic in Agda, intended for intermediate learners of the proof assistant.