cs.LOOct 19, 2026

Theorem prover Arend

Authors: Fedor Part, Valery Isaev, Sergey Sinchuk

Organizations: JetBrains Research

Abstract

This paper is an exposition of the theorem prover Arend developed at JetBrains Research. Arend language has been designed to facilitate the formalization of mathematics within the framework of univalent foundations and with the focus on constructive mathematics. It is based on a variant of homotopy type theory with cubical syntax that is more closely aligned with Martin-Löf Type Theory (MLTT) than fully computational cubical type theories, while still retaining some of their computational properties useful in practice. Among the most notable features of the Arend language is its powerful system of classes and records supporting subsumptive subtyping, partial implementations and anonymous extensions, which provides extensive flexibility for constructing hierarchies of definitions. Formalization in Arend is streamlined by the IntelliJ Arend plugin, which transforms IntelliJ IDEA into a full-fledged integrated development environment (IDE) for the Arend language. The main Arend library arend-lib includes formalizations in constructive algebra, topology and synthetic homotopy theory.

Explore similar work

CardsList
  1. Visored: A Controlled-Natural-Language Prover for LLM-Generated Mathematics

    Jun 16, 2026Xiyu Zhai, Xinyi Chen, Yiping Wang +3Automated Theorem ProvingLean Theorem Proving

  2. MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving

    May 26, 2026Jinzheng Li, Zeru Zhu, Yuanjie RenLarge Language Model-Guided Theorem ProvingAutomated Theorem Proving

  3. Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement

    Jun 4, 2026Jui-Hui Chung, Ziyang Cai, Zihao Li +14Automated Theorem ProvingLean Theorem Proving