| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | D2[Array] now has a Maybe instead of zero-size for zero | Tom Smeding | 6 days |
| | | | | | Remaining problem: 'add' in Compile doesn't use the D2 stuff | ||
| * | Commutativity marker on fold1i | Tom Smeding | 12 days |
| | | |||
| * | Complete accumulator revamp! | Tom Smeding | 2025-03-15 |
| | | |||
| * | Much process with accumulator revamp | Tom Smeding | 2025-03-14 |
| | | |||
| * | Compile: Fix right-precedence of (*) | Tom Smeding | 2025-03-04 |
| | | |||
| * | test: Simplify and make it a bit faster | Tom Smeding | 2025-02-28 |
| | | |||
| * | Add ext field to remaining AST constructors | Tom Smeding | 2025-01-27 |
| | | |||
| * | Working argument accum mode (...) | Tom Smeding | 2024-11-26 |
| | | | | | | | | | | | | | | | | The derivative of 'neural' in full accum mode is pretty atrocious now; I think this is because when you have code like this: \(a :: Arr 1 R) -> let b = a in let c = b in sum d then because the argument, as well as both let bindings, bind a value of array type, each will introduce an accumulator, hence resulting in three (!) nested `with` clauses that each just contribute their result back to their parent. This is pointless, and we should fix this. | ||
| * | WIP accum top-level args | Tom Smeding | 2024-11-26 |
| | | |||
| * | Complete GMM implementation | Tom Smeding | 2024-11-10 |
| | | |||
| * | Some more primitive operators | Tom Smeding | 2024-11-09 |
| | | |||
| * | Maximum/minimum | Tom Smeding | 2024-11-09 |
| | | |||
| * | Custom derivatives | Tom Smeding | 2024-11-08 |
| | | |||
| * | Remove build1 | Tom Smeding | 2024-11-07 |
| | | |||
| * | Support EOneHot | Tom Smeding | 2024-11-05 |
| | | |||
| * | WIP EOneHot | Tom Smeding | 2024-11-04 |
| | | |||
| * | Fix IIxNil warning | Tom Smeding | 2024-10-26 |
| | | |||
| * | Make interpreter debug printing conditional | Tom Smeding | 2024-10-26 |
| | | |||
| * | Debugging | Tom Smeding | 2024-10-26 |
| | | |||
| * | Fix interpreter bug | Tom Smeding | 2024-10-22 |
| | | |||
| * | Less warnings | Tom Smeding | 2024-10-22 |
| | | |||
| * | Differentiate Replicate | Tom Smeding | 2024-10-22 |
| | | |||
| * | Tests | Tom Smeding | 2024-10-21 |
| | | |||
| * | Reverse-by-forward, and checking neural (it's wrong) | Tom Smeding | 2024-10-01 |
| | | |||
| * | Test neural | Tom Smeding | 2024-09-25 |
| | | |||
| * | Interpreter typechecks, at the cost of compositionality of RepAc | Tom Smeding | 2024-09-22 |
| | | |||
| * | Stuff | Tom Smeding | 2024-09-22 |
| | | |||
| * | Some hacking | Tom Smeding | 2024-09-22 |
| | | |||
| * | A little interpreter accum progress | Tom Smeding | 2024-09-16 |
| | | |||
| * | 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 |
| | | |||
| * | Finish Accum implementation | Tom Smeding | 2024-09-11 |
| | | |||
| * | WIP interpreter | Tom Smeding | 2024-09-06 |
 |
index : chad-fast | |
| [no description] | git daemon user |
| summaryrefslogtreecommitdiff |