The following pages link to Comprehending monads (Q4279255):
Displaying 50 items.
- Algebraic dynamic programming for multiple context-free grammars (Q301600) (← links)
- Object-oriented programming: some history, and challenges for the next fifty years (Q393077) (← links)
- Translating regular expression matching into transducers (Q420836) (← links)
- Constructing language processors with algebra combinators (Q608238) (← links)
- Monad transformers as monoid transformers (Q615955) (← links)
- Generic multiset programming with discrimination-based joins and symbolic Cartesian products (Q656874) (← links)
- Principles of programming with complex objects and collection types (Q672333) (← links)
- Formal verification of an executable LTL model checker with partial order reduction (Q682350) (← links)
- Things to know when implementing KBO (Q861708) (← links)
- Arrows for secure information flow (Q964489) (← links)
- A computer-verified monadic functional implementation of the integral (Q987984) (← links)
- Query languages for bags and aggregate functions (Q1376407) (← links)
- Monad as modality (Q1392142) (← links)
- A new framework for declarative programming (Q1399960) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control (Q1726305) (← links)
- Coalgebras and monads in the semantics of Java (Q1853752) (← links)
- Kinded type inference for parametric overloading (Q1911131) (← links)
- Modular verification of programs with effects and effects handlers (Q1996433) (← links)
- Monads for the formalization of a pattern matching procedure (Q2017780) (← links)
- Iterated covariant powerset is not a monad (Q2134821) (← links)
- Generalized arrays for Stainless frames (Q2152661) (← links)
- For a few dollars more. Verified fine-grained algorithm analysis down to LLVM (Q2233462) (← links)
- Connected monads weakly preserve products (Q2310433) (← links)
- Powersets of terms and composite monads (Q2457025) (← links)
- A novel formal approach to program slicing (Q2463836) (← links)
- Boolean restriction categories and taut monads (Q2503320) (← links)
- On a monadic semantics for freshness (Q2566026) (← links)
- Monadic Sequence Testing and Explicit Test-Refinements (Q2827440) (← links)
- Specification of Logic Programming Languages from Reusable Semantic Building Blocks (Q2841297) (← links)
- The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads (Q2864158) (← links)
- Shifting the stage (Q2913928) (← links)
- Roles, stacks, histories: A triple for Hoare (Q3021420) (← links)
- Provenance as dependency analysis (Q3103615) (← links)
- Reflections on Monadic Lenses (Q3188278) (← links)
- Comprehending Ringads (Q3188283) (← links)
- Dragging Proofs Out of Pictures (Q3188284) (← links)
- Pointlessness is Better than Listlessness (Q3188290) (← links)
- A Reflection on Types (Q3188294) (← links)
- Unifying Theories of Programming with Monads (Q3455643) (← links)
- A System F with Call-by-Name Exceptions (Q3519511) (← links)
- Libraries for Generic Programming in Haskell (Q3649135) (← links)
- An algebra for distributed Big Data analytics (Q4577811) (← links)
- Push versus pull-based loop fusion in query engines (Q4577821) (← links)
- (Q4611382) (← links)
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving (Q4645809) (← links)
- (Q4668854) (← links)
- Invariants of monadic coalgebras (Q4917042) (← links)
- A graphical approach to monad compositions (Q4923371) (← links)
- Strongly-Normalizing Higher-Order Relational Queries (Q5043580) (← links)
