chad-fast - [no description]

	Commit message (Collapse)	Author	Age
*	Set Example module as ghci default	Tom Smeding	5 days
\|
*	Complete occCountX	Tom Smeding	5 days
\|
*	Simplify: Add placeholder recursion branches for convenience	Tom Smeding	5 days
\|
*	Simplify: Don't forget effects, again	Tom Smeding	5 days
\| \| \| \| \| \|	This didn't actually result in any test failures, but I caught it while hunting for a bug that turned out to be missing scaleMany in the new occCount.
*	Count: Correct alternative and scaleMany counting	Tom Smeding	5 days
\|
*	Code style	Tom Smeding	5 days
\|
*	WIP pruneExpr in AST.Count	Tom Smeding	2025-07-23
\|
*	Fix extremum bug in DualNumbers	Tom Smeding	2025-07-07
\|
*	Merge branch 'sparse'	Tom Smeding	2025-06-21
\|\
\| *	Some more effects to not ignoresparse	Tom Smeding	2025-06-18
\| \|
\| *	Don't destroy effects in UnMonoid	Tom Smeding	2025-06-18
\| \|
\| *	Don't introduce sparsity if zero is cheap	Tom Smeding	2025-06-18
\| \|
\| *	Don't destroy effects in sparse plus	Tom Smeding	2025-06-18
\| \|
\| *	Put smart accumulator redirection behind config flag	Tom Smeding	2025-06-18
\| \|
\| *	Give DeepZero to With	Tom Smeding	2025-06-18
\| \|
\| *	Complete pattern matches	Tom Smeding	2025-06-18
\| \|
\| *	Tests pass, should check if output is sensible	Tom Smeding	2025-06-18
\| \|
\| *	CHAD.hs compiles	Tom Smeding	2025-06-16
\| \|
\| *	WIP	Tom Smeding	2025-06-09
\| \|
\| *	More WIP sparsity	Tom Smeding	2025-06-08
\| \|
\| *	WIP mixed static/dynamic sparsity	Tom Smeding	2025-06-06
\| \|
* \|	Don't destroy effects in UnMonoid	Tom Smeding	2025-06-18
\|/
*	Simplify: also down-commute projections into EMaybe	Tom Smeding	2025-05-25
\|
*	Add AST.UnMonoid convenience repl import to Example	Tom Smeding	2025-05-25
\|
*	ERecompute	Tom Smeding	2025-05-25
\|
*	Print EMaybe as case	Tom Smeding	2025-05-25
\|
*	Implement mapExt as travExt	Tom Smeding	2025-05-25
\|
*	Compile: special-case to a single kernel function	Tom Smeding	2025-05-06
\|
*	Reorder TLEither to after TEither	Tom Smeding	2025-04-29
\|
*	simplify: Better simplify nested monoid ops	Tom Smeding	2025-04-29
\|
*	pretty: Print types of monoid ops	Tom Smeding	2025-04-29
\|
*	Simplify: Don't forget about effects -.-	Tom Smeding	2025-04-29
\|
*	Tracing simplifier	Tom Smeding	2025-04-29
\|
*	Complete monoidal accumulator rewrite	Tom Smeding	2025-04-29
\|
*	WIP interpreter support for new monoidal accumulators	Tom Smeding	2025-04-28
\|
*	WIP revamp accumulators again: explicit monoid types	Tom Smeding	2025-04-27
\| \| \| \| \| \| \| \|	No more D2 in accumulators! Paving the way for configurable sparsity of products and arrays. The idea is to make separate monoid types for a "product cotangent" and an "array cotangent" that can be lowered to either a sparse monoid or a non-sparse monoid. Downsides of this approach: lots of API duplication.
*	simplify: Additional rules inspired by Example.neural	Tom Smeding	2025-04-25
\|
*	pretty: Print build dimension	Tom Smeding	2025-04-25
\|
*	Don't unSTy	Tom Smeding	2025-04-25
\|
*	Remove done TODO	Tom Smeding	2025-04-25
\|
*	Compile: Give IDs to C modules for easier debugging	Tom Smeding	2025-04-24
\|
*	Compile: Reset accidentally enabled debug switch	Tom Smeding	2025-04-24
\|
*	compile: More checks, don't crash on check fail	Tom Smeding	2025-04-21
\|
*	test: A test for new accumMap logic	Tom Smeding	2025-04-21
\|
*	idana: Unify in either fallback case	Tom Smeding	2025-04-21
\|
*	splitLets: Don't split if unnecessary	Tom Smeding	2025-04-21
\|
*	pretty: Generate type-tagged fallback names	Tom Smeding	2025-04-21
\|
*	Let peeling (let x = Just e in e' ~> let x = e in e'[Just x/x])	Tom Smeding	2025-04-21
\|
*	Add integer modulo operator	Tom Smeding	2025-04-21
\|
*	Some progress with accumMap	Tom Smeding	2025-04-18
\|