Just do it
From MaRDI portal
Recommendations
- Towards a practical library for monadic equational reasoning in Coq
- Equational Reasoning with Applicative Functors
- Logical equations in monadic logic
- scientific article; zbMATH DE number 522862
- An equational metalogic for monadic equational systems
- Equational properties of iterative monads
- A simple abstract semantics for equational theories
- Monadic Translation of Intuitionistic Sequent Calculus
- A hierarchy of monadic effects for program verification using equational reasoning
- The proof monad
Cited in
(33)- Towards a linear algebra of programming
- State will do
- Declarative pearl: deriving monadic quicksort
- A hierarchy of monadic effects for program verification using equational reasoning
- Reasoning about functions with effects
- Equational Reasoning with Applicative Functors
- Typed linear algebra for weigthed (probabilistic) automata
- Witnessing side-effects
- Notions of bidirectional computation and entangled state monads
- Recursive monadic bindings
- New
- What is a pure functional?
- Applicative Lifting
- What is a purely functional language?
- scientific article; zbMATH DE number 2086497 (Why is no real title available?)
- Not by equations alone. Reasoning with extensible effects
- Combining predicate transformer semantics for effects: a case study in parsing regular languages
- How to prove decidability of equational theories with second-order computation analyser SOL
- Local algebraic effect theories
- A trustful monad for axiomatic reasoning with probability and nondeterminism
- Inductive reasoning about effectful data types
- Programming and reasoning with algebraic effects and dependent types
- Monads in action
- Effect polymorphism in higher-order logic (proof pearl)
- Effect polymorphism in higher-order logic (proof pearl)
- Towards a practical library for monadic equational reasoning in Coq
- An algebraic theory for shared-state concurrency
- Why adjunctions matter -- a functional programmer perspective
- A practical formalization of monadic equational reasoning in dependent-type theory
- From high to low: simulating nondeterminism and state with state
- How much is in a square? Calculating functional programs with squares
- Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
- Extending equational monadic reasoning with monad transformers
This page was built for publication: Just do it
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176957)
