| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Pass around an accumMap (but it's empty still) | Tom Smeding | 3 days |
| | | |||
| * | D2[Array] now has a Maybe instead of zero-size for zero | Tom Smeding | 5 days |
| | | | | | Remaining problem: 'add' in Compile doesn't use the D2 stuff | ||
| * | Commutativity marker on fold1i | Tom Smeding | 11 days |
| | | |||
| * | Complete accumulator revamp! | Tom Smeding | 2025-03-15 |
| | | |||
| * | Much process with accumulator revamp | Tom Smeding | 2025-03-14 |
| | | |||
| * | WIP revamp accumulator projection type repr | Tom Smeding | 2025-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 little | Tom Smeding | 2025-03-09 |
| | | |||
| * | Compile: Emit structs in proper order | Tom Smeding | 2025-02-25 |
| | | |||
| * | Pretty-printer that supports extension fields | Tom Smeding | 2025-01-28 |
| | | |||
| * | Add ext field to remaining AST constructors | Tom Smeding | 2025-01-27 |
| | | |||
| * | Somewhat working Compile | Tom Smeding | 2024-12-12 |
| | | |||
| * | UnMonoid | Tom Smeding | 2024-12-06 |
| | | |||
| * | Make EBuild derivative aware of zero cotangent arrays | Tom Smeding | 2024-11-11 |
| | | |||
| * | Complete GMM implementation | Tom Smeding | 2024-11-10 |
| | | |||
| * | Cleanup, more Language operations | Tom Smeding | 2024-11-09 |
| | | |||
| * | Some more primitive operators | Tom Smeding | 2024-11-09 |
| | | |||
| * | WIP maximum/minimum | Tom Smeding | 2024-11-08 |
| | | |||
| * | Custom derivatives | Tom Smeding | 2024-11-08 |
| | | |||
| * | WIP custom derivatives | Tom Smeding | 2024-11-08 |
| | | |||
| * | Remove build1 | Tom Smeding | 2024-11-07 |
| | | |||
| * | Generate EOneHot in D[EIdx] | Tom Smeding | 2024-11-05 |
| | | | | | | | This generates a one-hot for the zero-dimensional inner array because indexing one level further to the actual element is too difficult. But this should simplify away fine. | ||
| * | Support EOneHot | Tom Smeding | 2024-11-05 |
| | | |||
| * | WIP EOneHot | Tom Smeding | 2024-11-04 |
| | | |||
| * | Store only on tape what's used in the dual | Tom Smeding | 2024-10-29 |
| | | |||
| * | WIP preserve only subset of D0 bindings in dual (...) | Tom Smeding | 2024-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. | ||
| * | Debugging | Tom Smeding | 2024-10-26 |
| | | |||
| * | Fix interpreter bug | Tom Smeding | 2024-10-22 |
| | | |||
| * | Differentiate Replicate | Tom Smeding | 2024-10-22 |
| | | |||
| * | Tests | Tom Smeding | 2024-10-21 |
| | | |||
| * | Towards a test suite | Tom Smeding | 2024-10-07 |
| | | |||
| * | Some hacking | Tom Smeding | 2024-09-22 |
| | | |||
| * | WIP better zero/plus, fixing Accum (...) | Tom Smeding | 2024-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 operations | Tom Smeding | 2024-09-12 |
| | | |||
| * | A simple embedded frontend | Tom Smeding | 2024-09-05 |
| | | |||
| * | Generic accumulators | Tom Smeding | 2024-09-05 |
| | | |||
| * | WIP | Tom Smeding | 2024-09-04 |
| | | |||
| * | Inching towards drev of build | Tom Smeding | 2024-09-03 |
| | | |||
| * | Code cleanup, and OverloadedLabels for LSeg | Tom Smeding | 2024-09-02 |
| | | |||
| * | Autoweak! | Tom Smeding | 2024-09-02 |
| | | |||
| * | WIP autoWeak | Tom Smeding | 2024-09-02 |
| | | |||
| * | WIP Build1 | Tom Smeding | 2024-08-30 |
| | | |||
| * | Style | Tom Smeding | 2024-08-30 |
| | | |||
| * | Implement weakenExpr using subst | Tom Smeding | 2024-08-30 |
| | | | | | This saves one traversal function. | ||
| * | Migrate to accumulators (mostly removing EVM code) | Tom Smeding | 2024-08-30 |
| | | |||
| * | Move some definitions from AST to Data | Tom Smeding | 2024-01-27 |
| | | |||
| * | Linear-time tape reconstruction | Tom Smeding | 2024-01-26 |
| | | | | | A tutorial of the method here: https://play.haskell.org/saved/uHuGLfHZ | ||
| * | Getting further | Tom Smeding | 2024-01-25 |
| | | |||
| * | WIP in merge mode only return free variables | Tom Smeding | 2023-09-21 |
| | | | | | The code typechecks and may well work, but is untested. | ||
| * | Storage policy (accum / merge) | Tom Smeding | 2023-09-21 |
| | | |||
| * | Examples with conditionals | Tom Smeding | 2023-09-20 |
| | | |||
 |
index : chad-fast | |
| [no description] | git daemon user |
| summaryrefslogtreecommitdiff |