summaryrefslogtreecommitdiff
path: root/src/CHAD.hs
Commit message (Collapse)AuthorAge
* DebuggingTom Smeding2024-10-26
|
* Fix interpreter bugTom Smeding2024-10-22
|
* Less warningsTom Smeding2024-10-22
|
* Differentiate ReplicateTom Smeding2024-10-22
|
* TestsTom Smeding2024-10-21
|
* Towards a test suiteTom Smeding2024-10-07
|
* Reverse-by-forward, and checking neural (it's wrong)Tom Smeding2024-10-01
|
* Test neuralTom Smeding2024-09-25
|
* 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.
* Towards neuralTom Smeding2024-09-12
|
* Interpreter, some operationsTom Smeding2024-09-12
|
* Generic accumulatorsTom Smeding2024-09-05
|
* WIPTom Smeding2024-09-04
|
* Some workTom Smeding2024-09-03
|
* Inching towards drev of buildTom Smeding2024-09-03
|
* accumPromoteTom Smeding2024-09-02
|
* Code cleanup, and OverloadedLabels for LSegTom Smeding2024-09-02
|
* Autoweak!Tom Smeding2024-09-02
|
* WIP autoWeakTom Smeding2024-09-02
|
* WIP Build1Tom Smeding2024-08-30
|
* Migrate to accumulators (mostly removing EVM code)Tom Smeding2024-08-30
|
* Generalise freezeRet a little bitTom Smeding2024-08-29
|
* Less default caseTom Smeding2024-01-27
|
* Linear-time tape reconstructionTom Smeding2024-01-26
| | | | A tutorial of the method here: https://play.haskell.org/saved/uHuGLfHZ
* Embrace the PartialTypeSignaturesTom Smeding2024-01-25
|
* Finish rewriteTom Smeding2024-01-25
|
* Getting furtherTom Smeding2024-01-25
|
* More stuffTom Smeding2024-01-25
|
* WIP rewrite code transform typingTom Smeding2024-01-24
|
* Better modularity in subenv stuffTom Smeding2023-09-22
|
* 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
|
* WIP mixed environment descriptionTom Smeding2023-09-21
|
* Examples with conditionalsTom Smeding2023-09-20
|
* Pretty printTom Smeding2023-09-16
|
* 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-04 08:47:18 +0200