chad-fast/src/Language, branch master An implementation of CHAD, towards performance https://git.tomsmeding.com/chad-fast/atom?h=master 2025-11-10T20:50:25Z Move module hierarchy under CHAD. 2025-11-10T20:50:25Z Tom Smeding tom@tomsmeding.com 2025-11-10T20:49:45Z urn:sha1:174af2ba568de66e0d890825b8bda930b8e7bb96 Implement D[map] 2025-11-05T20:52:53Z Tom Smeding tom@tomsmeding.com 2025-11-05T20:52:53Z urn:sha1:38150f4f9792156d8c59439fe47ecb69a0a0e00b drevLambda works, TODO D[map] 2025-11-04T22:09:21Z Tom Smeding tom@tomsmeding.com 2025-11-04T22:09:21Z urn:sha1:57779d4303f377004705c8da06a5ac46177950b2 Compile foldd1 and foldd2 2025-10-30T19:09:10Z Tom Smeding tom@tomsmeding.com 2025-10-30T19:09:10Z urn:sha1:654b13d0de961788ed600e8eeb6c9fbbd736439e Implement reshape 2025-10-30T14:56:35Z Tom Smeding tom@tomsmeding.com 2025-10-30T14:56:35Z urn:sha1:4d456e4d34b1e4fb3725051d1b8a0c376b704692 Tests pass, should check if output is sensible 2025-06-17T22:00:11Z Tom Smeding tom@tomsmeding.com 2025-06-17T22:00:11Z urn:sha1:d1b2e2c3a3cdaf49ff5e4bae6fe9b0612c3779c2 CHAD.hs compiles 2025-06-16T21:21:55Z Tom Smeding tom@tomsmeding.com 2025-06-16T21:21:55Z urn:sha1:2b1a40b5933b8b0dceaae744e5b70cb604822c9d ERecompute 2025-05-25T21:35:31Z Tom Smeding tom@tomsmeding.com 2025-05-25T21:35:31Z urn:sha1:c36849cb6247f957b4e6b093e16d04421c8cea3d WIP revamp accumulators again: explicit monoid types 2025-04-27T21:34:59Z Tom Smeding tom@tomsmeding.com 2025-04-27T21:34:59Z urn: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 terms 2025-03-26T22:46:17Z Tom Smeding tom@tomsmeding.com 2025-03-26T22:46:17Z urn:sha1:f1e867838db63da71fea660740c23ab276a43a6c