Automatically proving equivalence by type-safe reflection
From MaRDI portal
Publication:2364699
Recommendations
Cites work
- scientific article; zbMATH DE number 6296049 (Why is no real title available?)
- A proof dedicated meta-language
- Auto in Agda. Programming proof search using reflection
- Compositional computational reflection
- Idris, a general-purpose dependently typed programming language: Design and implementation
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Mtac: a monad for typed tactic programming in Coq
- The formalization of syntax-based mathematical algorithms using quotation and evaluation
- Theorem Proving in Higher Order Logics
- Theorem proving modulo
- Theory presentation combinators
- Types for Proofs and Programs
- Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo
Cited in
(2)
This page was built for publication: Automatically proving equivalence by type-safe reflection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364699)