aboutsummaryrefslogtreecommitdiff
path: root/src/AST/Count.hs
Commit message (Collapse)AuthorAge
* drevLambda works, TODO D[map]HEADmasterTom Smeding9 hours
|
* WIP map + zipTom Smeding33 hours
|
* Simplify foldD2 to not sum x0 contributionsTom Smeding6 days
|
* Implement reshapeTom Smeding6 days
|
* Better fold D{1,2} primitivesTom Smeding8 days
|
* Count: Improve counting of tape in EFold1InnerD1Tom Smeding11 days
|
* WIP fold: everything but Compile (slow, but should be sound)Tom Smeding11 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
|
* Complete pattern matchesTom Smeding2025-06-18
|
* Tests pass, should check if output is sensibleTom Smeding2025-06-18
|
* WIP mixed static/dynamic sparsityTom Smeding2025-06-06
|
* ERecomputeTom Smeding2025-05-25
|
* 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.
* Commutativity marker on fold1iTom Smeding2025-03-20
|
* 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.
* Add ext field to remaining AST constructorsTom Smeding2025-01-27
|
* WIP maximum/minimumTom Smeding2024-11-08
|
* Custom derivativesTom Smeding2024-11-08
|
* WIP custom derivativesTom Smeding2024-11-08
|
* Remove build1Tom Smeding2024-11-07
|
* WIP EOneHotTom Smeding2024-11-04
|
* WIP preserve only subset of D0 bindings in dual (...)Tom Smeding2024-10-27
| | | | | | | | | | | | | | | The point of this is to ensure that when an expression occurs in a Build, then the parts of D0 that are only there to make sharing work out for D1 are not laboriously taped in an array and preserved for D2, only for D2 to ignore them. However, while the subtape machinery is a good first step, this is not everything: the current Build translation makes a Build for the (elementwise) tape and separately a build for the primal. Because the primal _does_ generally need the subtaped-away stuff, we can't just not tape those. TODO: figure out how to resolve this / what the next step is.
* Fix interpreter bugTom Smeding2024-10-22
|
* Differentiate ReplicateTom Smeding2024-10-22
|
* Add some missing casesTom Smeding2024-09-22
|
* WIP better zero/plus, fixing Accum (...)Tom Smeding2024-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 operationsTom Smeding2024-09-12
|
* Generic accumulatorsTom Smeding2024-09-05
|
* WIPTom Smeding2024-09-04
|
* Inching towards drev of buildTom Smeding2024-09-03
|
* WIP Build1Tom Smeding2024-08-30
|
* Migrate to accumulators (mostly removing EVM code)Tom Smeding2024-08-30
|
* Add missing importTom Smeding2024-02-15
|
* Examples with conditionalsTom Smeding2023-09-20
generated by cgit v1.2.3-70-g09d2 (git 2.51.0) at 2025-11-05 08:32:16 +0100