A Core Calculus for Documents
Summary
A formal core calculus for documents is presented, likely exploring type systems or semantics for document processing.
Similar Articles
A Typed, Algebraic Approach to Parsing
A paper presenting a typed, algebraic approach to parsing, likely from the University of Cambridge.
Sorries Are Not the Hard Part: An Expert-Review Case Study of a Semi-Autonomous Formalization
This paper presents a case study of using a large language model (Claude Code) to formalize Grothendieck's vanishing theorem in the Lean theorem prover. It finds that while agents can produce verified code, they struggle with definitions and API design, emphasizing the need for expert review beyond mere compilation.
Coalgebras and Automata
An introductory literate Haskell document exploring the relationship between coalgebras and automata, demonstrating how state machines can be modeled using fold and unfold operations within category theory.
Dependently typed Clojure DSL with a Lean4 compatible kernel
Ansatz is a Clojure library that implements Lean 4's Calculus of Inductive Constructions kernel, enabling Clojure programmers to write dependently typed, verified code with proofs compatible with Mathlib and compile to JVM bytecode.
Formal Conjectures: An Open and Evolving Benchmark for Verified Discovery in Mathematics
This paper introduces Formal Conjectures, an evolving benchmark of 2615 mathematical statements formalized in Lean 4, including open research conjectures for proof discovery and solved problems for auto-formalization, designed to evaluate automated reasoning systems with zero contamination.