chad-fast/src/Language, branch test-parallelAn implementation of CHAD, towards performance
https://git.tomsmeding.com/chad-fast/atom?h=test-parallel2025-06-17T22:00:11ZTests pass, should check if output is sensible2025-06-17T22:00:11ZTom Smedingtom@tomsmeding.com2025-06-17T22:00:11Zurn:sha1:d1b2e2c3a3cdaf49ff5e4bae6fe9b0612c3779c2CHAD.hs compiles2025-06-16T21:21:55ZTom Smedingtom@tomsmeding.com2025-06-16T21:21:55Zurn:sha1:2b1a40b5933b8b0dceaae744e5b70cb604822c9dERecompute2025-05-25T21:35:31ZTom Smedingtom@tomsmeding.com2025-05-25T21:35:31Zurn:sha1:c36849cb6247f957b4e6b093e16d04421c8cea3dWIP revamp accumulators again: explicit monoid types2025-04-27T21:34:59ZTom Smedingtom@tomsmeding.com2025-04-27T21:34:59Zurn:sha1:b1664532eaebdf0409ab6d93fc0ba2ef8dfbf372
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.
Language: support Maybe and Accum terms2025-03-26T22:46:17ZTom Smedingtom@tomsmeding.com2025-03-26T22:46:17Zurn:sha1:f1e867838db63da71fea660740c23ab276a43a6cCommutativity marker on fold1i2025-03-20T17:32:22ZTom Smedingt.j.smeding@uu.nl2025-03-20T17:32:22Zurn:sha1:d030802dd6d960afa80ac84a5580a46d39c02822Compile: index into arrays2025-03-02T11:57:07ZTom Smedingtom@tomsmeding.com2025-03-02T11:57:07Zurn:sha1:52184258f8eef227c743726770e984202e101919Add ext field to remaining AST constructors2025-01-27T14:08:02ZTom Smedingt.j.smeding@uu.nl2025-01-27T14:08:02Zurn:sha1:88fae8c2914b805a733b71de58ab672124e6069cCleanup, more Language operations2024-11-09T21:59:12ZTom Smedingtom@tomsmeding.com2024-11-09T21:59:12Zurn:sha1:d4d4473ee229674f73929c0860a7e29302330361Add Custom to Language2024-11-09T21:58:52ZTom Smedingtom@tomsmeding.com2024-11-09T21:58:52Zurn:sha1:34887168c0e2deb549e0e7c77e837ab269d894a2