Expand description
Auto-generated module
🤖 Generated with SplitRS
Structs§
- Affine
Traversal - An affine traversal (0 or 1 focus).
- Apomorphism
- Apomorphism: anamorphism with early termination.
- Applicative
Data - Arrow
- An Arrow: a generalised function from A to B with category operations.
- Arrow
Data - Boehm
Berarducci - Böhm-Berarducci (CPS) encoding of recursive types.
- Church
Numerals - Church encoding utilities for natural numbers.
- Coerce
- A coercion with a proof obligation (modelled as a runtime-checked cast).
- Comonad
Extend ComonadExtend— utility struct for comonad extension operations.- Cont
- Continuation monad: Cont r a = (a -> r) -> r.
- CpsTransform
- Continuation passing style transform.
- Defunct
Closure - Defunctionalized closure representation.
- Dependent
Type Example - Effect
Handler - An effect handler that handles effect type E and produces B.
- Effect
System - Algebraic effect system.
- Free
Monad Info - Free monad functor encoding.
- Free
Monad Interpreter FreeMonadInterpreterruns aConsoleProgagainst a provided handler.- Futumorphism
- Futumorphism: anamorphism with look-ahead capability.
- HMap
- A type-erased type-level map (heterogeneous map keyed by strings).
- Histomorphism
- Histomorphism: catamorphism with access to full history.
- Homotopy
Equivalence - Hylomorphism
- Hylomorphism: unfold an anamorphism then fold a catamorphism.
- Iso
- An isomorphism between types S and A.
- Lens
- A lawful lens focusing on field A inside structure S.
- Lens
Composer LensComposerprovides utilities for composing lenses and verifying laws.- Paramorphism
- Paramorphism: catamorphism with access to original sub-trees.
- Prism
- A prism focusing on one variant of a sum type.
- Profunctor
Data - Profunctor
Optic - A profunctor-encoded optic, represented as a Rust trait object.
- Reader
Monad - Reader monad: Reader r a = r -> a.
- Recursion
Scheme Eval RecursionSchemeEvalprovides catamorphism and anamorphism overRoseTree.- Scott
Encoding - Scott encoding of algebraic data types.
- Singleton
- A singleton: a value that is uniquely determined by its type.
- State
Monad - State monad: State s a = s -> (a, s).
- Traversable
Data - Traversal
- A traversal focusing on zero or more As inside S.
- Type
Constructor Functor - Category theory view: functors as type constructors.
- Type
Equality - Type equality evidence: proof that S and T are the same type.
- Writer
Monad - Writer monad: Writer w a = (a, w) with Monoid w.
- Yoneda
Embedding - Yoneda lemma embedding: Hom(A, -) ≅ F where F is a functor.
- Zipper
- A zipper over a non-empty vector: models a focused list comonad.
Enums§
- Console
Effect - A simple algebraic effect for the interpreter.
- Console
Prog - A free monad over
ConsoleEffectfor console programs. - Effect
- A simple algebraic effect: a computation that may perform an effect.
- Free
Applicative - Free applicative functor (simplified representation).
- Free
Monad - A free monad over a functor F, with values in A.
- HList
- A heterogeneous list (type-erased at runtime; type safety tracked by the user).
- Rose
Tree - Evaluator for generic recursion schemes over rose trees.