summaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAge
* WIP parallel test suitetest-parallelTom Smeding42 hours
|
* Some more effects to not ignoresparseTom Smeding3 days
|
* Don't destroy effects in UnMonoidTom Smeding3 days
|
* test: Diligently check UnMonoid correctnessTom Smeding3 days
|
* test: Test both default and accum configsTom Smeding3 days
|
* test-framework: Correct line count when collapsing with nested subgroupsTom Smeding3 days
|
* Don't introduce sparsity if zero is cheapTom Smeding3 days
|
* Don't destroy effects in sparse plusTom Smeding3 days
|
* Put smart accumulator redirection behind config flagTom Smeding3 days
|
* Give DeepZero to WithTom Smeding3 days
|
* Complete pattern matchesTom Smeding3 days
|
* TODO deep zero in accum + fix warningsTom Smeding4 days
|
* Tests pass, should check if output is sensibleTom Smeding4 days
|
* CHAD.hs compilesTom Smeding5 days
|
* WIPTom Smeding12 days
|
* More WIP sparsityTom Smeding13 days
|
* WIP mixed static/dynamic sparsityTom Smeding2025-06-06
|
* Simplify: also down-commute projections into EMaybeTom Smeding2025-05-25
|
* Add AST.UnMonoid convenience repl import to ExampleTom Smeding2025-05-25
|
* ERecomputeTom Smeding2025-05-25
|
* Print EMaybe as caseTom Smeding2025-05-25
|
* Implement mapExt as travExtTom Smeding2025-05-25
|
* Compile: special-case to a single kernel functionTom Smeding2025-05-06
|
* 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
|
* Simplify: Don't forget about effects -.-Tom Smeding2025-04-29
|
* Tracing simplifierTom Smeding2025-04-29
|
* test-framework: Support --hedgehog-shrinksTom Smeding2025-04-29
|
* Complete monoidal accumulator rewriteTom Smeding2025-04-29
|
* WIP interpreter support for new monoidal accumulatorsTom Smeding2025-04-28
|
* 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.
* simplify: Additional rules inspired by Example.neuralTom Smeding2025-04-25
|
* pretty: Print build dimensionTom Smeding2025-04-25
|
* Don't unSTyTom Smeding2025-04-25
|
* Remove done TODOTom Smeding2025-04-25
|
* test: Fix template constraint systemTom Smeding2025-04-24
|
* test: Catch IO exceptions in hedgehogTom Smeding2025-04-24
|
* Compile: Give IDs to C modules for easier debuggingTom Smeding2025-04-24
|
* Compile: Reset accidentally enabled debug switchTom Smeding2025-04-24
|
* test: Also run arr-rebind-simple, why notTom Smeding2025-04-21
|
* compile: More checks, don't crash on check failTom Smeding2025-04-21
|
* test: A test for new accumMap logicTom Smeding2025-04-21
|
* test: Types synonyms cleanupTom Smeding2025-04-21
|
* idana: Unify in either fallback caseTom Smeding2025-04-21
|
* splitLets: Don't split if unnecessaryTom Smeding2025-04-21
|
* pretty: Generate type-tagged fallback namesTom Smeding2025-04-21
|
* Let peeling (let x = Just e in e' ~> let x = e in e'[Just x/x])Tom Smeding2025-04-21
|
* Add integer modulo operatorTom Smeding2025-04-21
|
* Import orderingTom Smeding2025-04-21
|
generated by cgit v1.2.3-70-g09d2 (git 2.48.1) at 2025-06-21 18:23:30 +0200