The following pages link to Comprehending monads (Q4279255):
Displayed 27 items.
- 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)
- 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)
- Coalgebras and monads in the semantics of Java (Q1853752) (← links)
- Kinded type inference for parametric overloading (Q1911131) (← 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)
- Shifting the stage (Q2913928) (← links)
- Roles, stacks, histories: A triple for Hoare (Q3021420) (← links)
- Provenance as dependency analysis (Q3103615) (← links)
- A System F with Call-by-Name Exceptions (Q3519511) (← links)
- Libraries for Generic Programming in Haskell (Q3649135) (← links)
- (Q4668854) (← links)
- Computer Certified Efficient Exact Reals in Coq (Q5200110) (← links)
- Fusion of recursive programs with computational effects (Q5941164) (← links)
- A unifying approach to goal-directed evaluation (Q5957058) (← links)