The following pages link to Comprehending monads (Q4279255):
Displaying 15 items.
- Invariants of monadic coalgebras (Q4917042) (← links)
- A graphical approach to monad compositions (Q4923371) (← links)
- Strongly-Normalizing Higher-Order Relational Queries (Q5043580) (← links)
- Monads, indexes and transformations (Q5044745) (← links)
- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs (Q5048997) (← links)
- (Q5089033) (← links)
- Wrapper semantics of an object-oriented programming language with state (Q5096238) (← links)
- How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922) (← links)
- Computer Certified Efficient Exact Reals in Coq (Q5200110) (← links)
- Taut Monads, Dynamic Logic and Determinism (Q5262941) (← links)
- Declarative Debugging Meets the World (Q5403478) (← links)
- Fusion of recursive programs with computational effects (Q5941164) (← links)
- A unifying approach to goal-directed evaluation (Q5957058) (← links)
- Reversible monadic computing (Q5971401) (← links)
- Plethysms and operads (Q6141135) (← links)