Just Type It in Isabelle! AI Agents Drafting, Mechanizing, and Generalizing from Human Hints

📅 2026-04-17
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the problem of generating complete and minimal type annotations for rank-one polymorphic λ-calculus terms in Isabelle, ensuring semantic consistency under reparsing and type inference. We propose a human–AI collaborative workflow that integrates handcrafted proofs by human experts with large language model (LLM)-driven automated formalization, guided by human-provided prompts to steer AI-based optimization and generalization. This approach constitutes the first systematic integration of human intuition and AI-powered formal reasoning, enabling a metatheoretic analysis, a complete specification, and machine-verified correctness of the type annotation problem within Isabelle/HOL. The methodology substantially enhances both the efficiency and generalizability of formal proofs.

Technology Category

Application Category

📝 Abstract
Type annotations are essential when printing terms in a way that preserves their meaning under reparsing and type inference. We study the problem of complete and minimal type annotations for rank-one polymorphic $λ$-calculus terms, as used in Isabelle. Building on prior work by Smolka, Blanchette et al., we give a metatheoretical account of the problem, with a full formal specification and proofs, and formalize it in Isabelle/HOL. Our development is a series of experiments featuring human-driven and AI-driven formalization workflows: a human and an LLM-powered AI agent independently produce pen-and-paper proofs, and the AI agent autoformalizes both in Isabelle, with further human-hinted AI interventions refining and generalizing the development.
Problem

Research questions and friction points this paper is trying to address.

type annotations
rank-one polymorphism
λ-calculus
Isabelle
type inference
Innovation

Methods, ideas, or system contributions that make the work stand out.

type annotations
Isabelle/HOL
AI-driven formalization
rank-one polymorphism
autoformalization
🔎 Similar Papers
No similar papers found.
K
Kevin Kappelmann
Department of Computer Science, University of Sheffield, United Kingdom
M
Maximilian Schäffeler
Department of Informatics, King’s College London, United Kingdom
L
Lukas Stevens
Department of Computer Science, University of Copenhagen, Denmark
Mohammad Abdulaziz
Mohammad Abdulaziz
King's College London
Interactive Theorem ProvingTheoretical Computer ScienceArtificial Intelligence
Andrei Popescu
Andrei Popescu
University of Sheffield
proof assistantsinformation flow securitylogical foundationssyntax with bindingsdatatypes
Dmitriy Traytel
Dmitriy Traytel
University of Copenhagen
Interactive Theorem ProvingRuntime Verification