aboutsummaryrefslogtreecommitdiff
path: root/src/AST
Commit message (Collapse)AuthorAge
* Count: Improve counting of tape in EFold1InnerD1foldTom Smeding36 hours
|
* WIP fold: everything but Compile (slow, but should be sound)Tom Smeding47 hours
|
* subenvSplit (unused, commented out, but it's written now)Tom Smeding3 days
|
* Helper functions bpush and weakenBindingsETom Smeding3 days
|
* Complete occCountXTom Smeding2025-10-08
|
* Count: Correct alternative and scaleMany countingTom Smeding2025-10-08
|
* Code styleTom Smeding2025-10-08
|
* WIP pruneExpr in AST.CountTom Smeding2025-07-23
|
* Merge branch 'sparse'Tom Smeding2025-06-21
|\
| * Some more effects to not ignoresparseTom Smeding2025-06-18
| |
| * Don't destroy effects in UnMonoidTom Smeding2025-06-18
| |
| * Don't introduce sparsity if zero is cheapTom Smeding2025-06-18
| |
| * Don't destroy effects in sparse plusTom Smeding2025-06-18
| |
| * Give DeepZero to WithTom Smeding2025-06-18
| |
| * Complete pattern matchesTom Smeding2025-06-18
| |
| * Tests pass, should check if output is sensibleTom Smeding2025-06-18
| |
| * CHAD.hs compilesTom Smeding2025-06-16
| |
| * WIPTom Smeding2025-06-09
| |
| * More WIP sparsityTom Smeding2025-06-08
| |
| * WIP mixed static/dynamic sparsityTom Smeding2025-06-06
| |
* | Don't destroy effects in UnMonoidTom Smeding2025-06-18
|/
* ERecomputeTom Smeding2025-05-25
|
* Print EMaybe as caseTom Smeding2025-05-25
|
* Reorder TLEither to after TEitherTom Smeding2025-04-29
|
* simplify: Better simplify nested monoid opsTom Smeding2025-04-29
|
* pretty: Print types of monoid opsTom Smeding2025-04-29
|
* WIP revamp accumulators again: explicit monoid typesTom Smeding2025-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.
* pretty: Print build dimensionTom Smeding2025-04-25
|
* Don't unSTyTom Smeding2025-04-25
|
* splitLets: Don't split if unnecessaryTom Smeding2025-04-21
|
* pretty: Generate type-tagged fallback namesTom Smeding2025-04-21
|
* Add integer modulo operatorTom Smeding2025-04-21
|
* pretty: Print arguments of open expressionTom Smeding2025-04-18
|
* Split product lets before chadTom Smeding2025-04-05
|
* Pass around an accumMap (but it's empty still)Tom Smeding2025-03-28
|
* Pretty: fix printing of EMaybeTom Smeding2025-03-27
|
* D2[Array] now has a Maybe instead of zero-size for zeroTom Smeding2025-03-26
| | | | Remaining problem: 'add' in Compile doesn't use the D2 stuff
* Commutativity marker on fold1iTom Smeding2025-03-20
|
* Compile EAccumTom Smeding2025-03-17
|
* Much process with accumulator revampTom Smeding2025-03-14
|
* WIP revamp accumulator projection type reprTom Smeding2025-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.
* Clean up code organisation a littleTom Smeding2025-03-09
|
* pretty: Print x value for (!)Tom Smeding2025-03-07
|
* pprintExprTom Smeding2025-03-07
|
* Compile: Implement EWith (TODO EAccum)Tom Smeding2025-03-05
| | | | That's going to be a mess
* Fix ppParen in pretty of EWithTom Smeding2025-03-04
|
* Fix some pretty-printingTom Smeding2025-03-01
|
* UnMonoid: Properly recurseTom Smeding2025-02-25
|
* Pretty: Allow colouring exts (currently not)Tom Smeding2025-02-25
|
* Compile: Emit structs in proper orderTom Smeding2025-02-25
|
generated by cgit v1.2.3-70-g09d2 (git 2.51.0) at 2025-10-26 21:18:33 +0100