Dedekind 0.0.0
A structuralist C++23 Module Library
Loading...
Searching...
No Matches
sequences Directory Reference
Directory dependency graph for sequences:
src/main/modules/dedekind/sequences

Files

 
convergence.cppm
 Sequence/series convergence predicates and standard test hooks.
 
curve.cppm
 The Curve (Continuum-Indexed Morphism Family).
 
finite.cppm
 Compile-time, array-backed realizations of a sequence and a net — the constexpr siblings of the heap-backed Path.
 
fold.cppm
 The left fold (catamorphism) over an enumerable sequence.
 
limits.cppm
 The Convergence Morphism (Resolution of the Path).
 
net.cppm
 The Path (The Morphism of Enumeration).
 
path.cppm
 The Path (Morphism of Enumeration): a monad and a comonad.
 
pst.cppm
 The Pst fragment's normal form: a decidable set over a finite chain, folded into its run list as the chain is walked.
 
ranges.cppm
 The bridge between order's intervals and std::ranges iota views, and the bounded sets built on it.
 
relprod.cppm
 The relative product \(R;S\) over a FINITE ℕ-prefix middle: the generalization of :relational's Boolean-middle >> (which enumerates {false,true}) to a bounded ℕ carrier \([0,M)\). The \(\exists\)-over-the-middle is a short-circuiting scan (std::ranges::any_of: it stops at the first witness), and the bound M is carried on the composed type so repeated squaring (R;R, (R;R);(R;R), …) stays bounded — the semantic for-loop of bounded transitive closure (#795).
 
samples.cppm
 Named §3 page-2 sample sequences: is_even and fibonacci.
 
sequences.cppm
 Sequences, paths, and (co-)Kleisli triples over directed sets.
 
tail_equivalence.cppm
 Tail-equivalence of paths: the congruence of "agreeing eventually", tying the sequence layer to the #718 quotient machinery.