The proof monad
From MaRDI portal
Publication:974136
DOI10.1016/J.JLAP.2010.03.002zbMATH Open1208.68144OpenAlexW2074233181MaRDI QIDQ974136FDOQ974136
Authors: Florent Kirchner, César Muñoz 
Publication date: 27 May 2010
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2010.03.002
Recommendations
Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- Edinburgh LCF. A mechanized logic of computation
- Categorical logic and type theory
- Crafting a Proof Assistant
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notions of computation and monads
- Strategic computation and deduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Locally cartesian closed categories and type theory
- Simple consequence relations
- Theorem proving modulo
- Title not available (Why is that?)
- HYPERDOCTRINES, NATURAL DEDUCTION AND THE BECK CONDITION
- Adjointness in Foundations
- Deductive systems and categories
- The duality of computation
- PVS\#: streamlined tacticals for PVS
- Rewrite strategies in the rewriting calculus
- Tinycals: step by step tacticals
Cited In (5)
Uses Software
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)
