| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Commutativity marker on fold1i | Tom Smeding | 11 days |
| | | |||
| * | simplifyOneHotTerm | Tom Smeding | 2025-03-16 |
| | | |||
| * | Much process with accumulator revamp | Tom Smeding | 2025-03-14 |
| | | |||
| * | Fix big oops bug in simplify | Tom Smeding | 2025-03-04 |
| | | | | | | The dangers of writing a simplifier for an effectful language. I thought this was easy, but apparently it's all too simple to trip up... | ||
| * | Add some simplify flags infrastructure for debugging | Tom Smeding | 2025-03-04 |
| | | |||
| * | simplify: Halfway beta-reduce product projections in effectful context | Tom Smeding | 2025-03-01 |
| | | |||
| * | 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 |
| | | |||
| * | Simplify: Reduce plus of literals | Tom Smeding | 2024-12-06 |
| | | |||
| * | Simplify: Some forgotten 'acted' | Tom Smeding | 2024-12-06 |
| | | |||
| * | Fix bug in simplifier (effects are hard) | Tom Smeding | 2024-11-10 |
| | | |||
| * | 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 |
| | | |||
| * | Some simplification rules | Tom Smeding | 2024-11-06 |
| | | |||
| * | WIP EOneHot | Tom Smeding | 2024-11-04 |
| | | |||
| * | simplifyFix | Tom Smeding | 2024-10-29 |
| | | |||
| * | Fix interpreter bug | Tom Smeding | 2024-10-22 |
| | | |||
| * | Differentiate Replicate | Tom Smeding | 2024-10-22 |
| | | |||
| * | Add some missing cases | 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 |
| | | |||
| * | Simple Build1 seems to work | 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 |
| | | |||
| * | WIP Build1 | 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 |
| | | |||
| * | Pretty print let bindings in do notation | Tom Smeding | 2023-09-21 |
| | | |||
| * | Storage policy (accum / merge) | Tom Smeding | 2023-09-21 |
| | | |||
| * | Examples with conditionals | Tom Smeding | 2023-09-20 |
| | | |||
| * | Stuff | Tom Smeding | 2023-09-19 |
 |
index : chad-fast | |
| [no description] | git daemon user |
| summaryrefslogtreecommitdiff |