chad-fast - [no description]

	Commit message (Collapse)	Author	Age
*	Pass around an accumMap (but it's empty still)HEAD master	Tom Smeding	11 hours
\|
*	WIP revamp accumulator projection type repr	Tom Smeding	2025-03-14
\| \| \| \| \| \| \|	I stopped working on this because I realised that having sparse products (and coproducts, prehaps) everywhere is a very bad idea in general, and that we need to fix that first before really being able to do anything else productive with performance.
*	More compact test output	Tom Smeding	2025-03-10
\|
*	test: Simplify and make it a bit faster	Tom Smeding	2025-02-28
\|
*	test: Use tasty	Tom Smeding	2025-02-28
\|
*	Remove stupid old nonworking cuda stub	Tom Smeding	2025-02-28
\|
*	Compile to C and load using dlopen	Tom Smeding	2025-02-28
\|
*	Purge Example.Format	Tom Smeding	2025-01-28
\|
*	Pretty-printer that supports extension fields	Tom Smeding	2025-01-28
\|
*	WIP identity analysis	Tom Smeding	2025-01-20
\|
*	Start WIP compile-to-C	Tom Smeding	2024-12-06
\|
*	Rename Compile -> CompileCu	Tom Smeding	2024-12-06
\|
*	UnMonoid	Tom Smeding	2024-12-06
\|
*	WIP UnMonoid (to be used for compiling to C)	Tom Smeding	2024-12-06
\|
*	WIP accum top-level args	Tom Smeding	2024-11-26
\|
*	Prepare for introducing top-level args in accum mod	Tom Smeding	2024-11-23
\|
*	Benchmark GMM	Tom Smeding	2024-11-14
\|
*	Test gmm	Tom Smeding	2024-11-10
\|
*	Test GMM; it fails	Tom Smeding	2024-11-10
\|
*	Most of GMM	Tom Smeding	2024-11-09
\|
*	WIP custom derivatives	Tom Smeding	2024-11-08
\|
*	Benchmark	Tom Smeding	2024-11-07
\|
*	WIP testing neural	Tom Smeding	2024-10-18
\|
*	More towards test suite	Tom Smeding	2024-10-14
\|
*	Towards a test suite	Tom Smeding	2024-10-07
\|
*	Reverse-by-forward, and checking neural (it's wrong)	Tom Smeding	2024-10-01
\|
*	Dual-numbers forward AD	Tom Smeding	2024-09-28
\|
*	Test neural	Tom Smeding	2024-09-25
\|
*	WIP better zero/plus, fixing Accum (...)	Tom Smeding	2024-09-13
\| \| \| \| \| \| \| \| \| \| \| \| \|	The accumulator implementation was wrong because it forgot (in accumAdd) to take into account that values may be variably-sized. Furthermore, it was also complexity-inefficient because it did not build up a sparse value. Thus let's go for the Haskell-interpreter-equivalent of what a real, fast, compiled implementation would do: just a tree with mutable variables. In practice one can decide to indeed flatten parts of that tree, i.e. using a tree representation for nested pairs is bad, but that should have been done _before_ execution and for _all_ occurrences of that type fragment, not live at runtime by the accumulator implementation.
*	Interpreter, some operations	Tom Smeding	2024-09-12
\|
*	WIP interpreter	Tom Smeding	2024-09-06
\|
*	Named source language	Tom Smeding	2024-09-06
\|
*	A simple embedded frontend	Tom Smeding	2024-09-05
\|
*	WIP	Tom Smeding	2024-09-04
\|
*	Code cleanup, and OverloadedLabels for LSeg	Tom Smeding	2024-09-02
\|
*	WIP autoWeak	Tom Smeding	2024-09-02
\|
*	Migrate to accumulators (mostly removing EVM code)	Tom Smeding	2024-08-30
\|
*	Ramblings in Compile	Tom Smeding	2024-01-27
\|
*	Getting further	Tom Smeding	2024-01-25
\|
*	WIP rewrite code transform typing	Tom Smeding	2024-01-24
\|
*	Examples with conditionals	Tom Smeding	2023-09-20
\|
*	Stuff	Tom Smeding	2023-09-19
\|
*	Pretty print	Tom Smeding	2023-09-16
\|
*	CHAD ops	Tom Smeding	2023-09-16
\|
*	CHAD case	Tom Smeding	2023-09-16
\|
*	Initial	Tom Smeding	2023-09-10