The proof monad
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1696760 (Why is no real title available?)
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 4103051 (Why is no real title available?)
- scientific article; zbMATH DE number 195102 (Why is no real title available?)
- scientific article; zbMATH DE number 226803 (Why is no real title available?)
- scientific article; zbMATH DE number 234014 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Adjointness in Foundations
- Categorical logic and type theory
- Crafting a Proof Assistant
- Deductive systems and categories
- Edinburgh LCF. A mechanized logic of computation
- HYPERDOCTRINES, NATURAL DEDUCTION AND THE BECK CONDITION
- Locally cartesian closed categories and type theory
- Notions of computation and monads
- PVS\#: streamlined tacticals for PVS
- Rewrite strategies in the rewriting calculus
- Simple consequence relations
- Strategic computation and deduction
- The duality of computation
- Theorem proving modulo
- Tinycals: step by step tacticals
Cited in
(5)
This page was built for publication: The proof monad
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974136)