The following pages link to Just do it (Q5176957):
Displaying 13 items.
- Towards a linear algebra of programming (Q1941862) (← links)
- Declarative pearl: deriving monadic quicksort (Q2039941) (← links)
- Equational Reasoning with Applicative Functors (Q2829262) (← links)
- Typed Linear Algebra for Weigthed (Probabilistic) Automata (Q2914693) (← links)
- Notions of Bidirectional Computation and Entangled State Monads (Q2941175) (← links)
- New (Q3178271) (← links)
- Not by equations alone: Reasoning with extensible effects (Q5018775) (← links)
- (Q5020618) (← links)
- How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922) (← links)
- Local algebraic effect theories (Q5120228) (← links)
- A trustful monad for axiomatic reasoning with probability and nondeterminism (Q5152658) (← links)
- Effect polymorphism in higher-order logic (proof pearl) (Q5915785) (← links)
- Effect polymorphism in higher-order logic (proof pearl) (Q5919584) (← links)
