- Apr 15, 2005
In the thread on Lazy Transformations we explored using a combination unary function composition together with Yoneda / Coyoneda data types to transform a type for lazily evaluation of transformations in order to avoid unnecessary compute operations.Previous Thread
In the last thread we explored algebraic data types and then creating a monadic implementation of a tagged union type in C#.
Index to other threads on functional programming:
- History of Functional Programming / Category Theory
- Category Theory for programmers
- Functional design approach to a problem
- Recursion, Composition, Pipe Forward, Higher Order Function, Side Effects
- Covariance / Contravariance, Reducers / Transducers
- Predictable State Engine
- Exception Handling
- Lazy Transformations / Yoneda and Coyoneda
- Monadic Computations / Nullable
- Algebraic Data Types / Tagged Union Types
In this thread we'll be looking at how to achieve the same for monadic computations; I'll start with a short refresher of what are monadic computations and why they are important algebra in Functional Programming.