| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | test: Start of a list of compile tests | Tom Smeding | 5 days |
| | | |||
| * | compile: WIP reference-counted arrays | Tom Smeding | 2025-03-02 |
| | | |||
| * | Compile to C and load using dlopen | Tom Smeding | 2025-02-28 |
| | | |||
| * | Benchmark | Tom Smeding | 2024-11-07 |
| | | |||
| * | Reverse-by-forward, and checking neural (it's wrong) | Tom Smeding | 2024-10-01 |
| | | |||
| * | The size of the empty shape is 1, not 0 | Tom Smeding | 2024-09-26 |
| | | |||
| * | Test neural | Tom Smeding | 2024-09-25 |
| | | |||
| * | Some hacking | Tom Smeding | 2024-09-22 |
| | | |||
| * | WIP Accum stuff | Tom Smeding | 2024-09-15 |
| | | |||
| * | 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 |
 |
index : chad-fast | |
| [no description] | git daemon user |
| summaryrefslogtreecommitdiff |