arXiv (All)
open access
A Transfer Tactic for Lean
Rewriting in proof assistants spans a strict hierarchy. Equational rewriting substitutes based on extensional equality; subequational rewriting substitutes based on homogeneous relations such as $\leq$ or $\subseteq$, justified by monotonicity lemmas; and generalized rewriting relates different oper
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Display to Labeled Proofs and Back Again for Tense Logics#711054
- An Infinitary and a Cyclic Sequent Calculus for Non-Monotone Inductive Definitions#1062234
- Proof2Hybrid: Automatic Mathematical Benchmark Synthesis for Proof-Centric Problems#792648
- Proof2Hybrid: Automatic Mathematical Benchmark Synthesis for Proof-Centric Problems#788648
- Formalization Systems I: Mathematics — A Non-Modal Fixation#693502
Record · ID 1116446
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive