summaryrefslogtreecommitdiff
path: root/src/AST.hs
Commit message (Collapse)AuthorAge
* Generate EOneHot in D[EIdx]Tom Smeding2024-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 EOneHotTom Smeding2024-11-05
|
* WIP EOneHotTom Smeding2024-11-04
|
* Store only on tape what's used in the dualTom Smeding2024-10-29
|
* 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.
* DebuggingTom Smeding2024-10-26
|
* Fix interpreter bugTom Smeding2024-10-22
|
* Differentiate ReplicateTom Smeding2024-10-22
|
* TestsTom Smeding2024-10-21
|
* Towards a test suiteTom Smeding2024-10-07
|
* Some hackingTom 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
|
* A simple embedded frontendTom Smeding2024-09-05
|
* Generic accumulatorsTom Smeding2024-09-05
|
* WIPTom Smeding2024-09-04
|
* Inching towards drev of buildTom Smeding2024-09-03
|
* Code cleanup, and OverloadedLabels for LSegTom Smeding2024-09-02
|
* Autoweak!Tom Smeding2024-09-02
|
* WIP autoWeakTom Smeding2024-09-02
|
* WIP Build1Tom Smeding2024-08-30
|
* StyleTom Smeding2024-08-30
|
* Implement weakenExpr using substTom Smeding2024-08-30
| | | | This saves one traversal function.
* Migrate to accumulators (mostly removing EVM code)Tom Smeding2024-08-30
|
* Move some definitions from AST to DataTom Smeding2024-01-27
|
* Linear-time tape reconstructionTom Smeding2024-01-26
| | | | A tutorial of the method here: https://play.haskell.org/saved/uHuGLfHZ
* Getting furtherTom Smeding2024-01-25
|
* WIP in merge mode only return free variablesTom Smeding2023-09-21
| | | | The code typechecks and may well work, but is untested.
* Storage policy (accum / merge)Tom Smeding2023-09-21
|
* Examples with conditionalsTom Smeding2023-09-20
|
* StuffTom Smeding2023-09-19
|
* CHAD opsTom Smeding2023-09-16
|
* CHAD caseTom Smeding2023-09-16
|
* CHAD letTom Smeding2023-09-10
|
* InitialTom Smeding2023-09-10
generated by cgit v1.2.3-70-g09d2 (git 2.48.1) at 2025-04-03 09:00:53 +0200