aboutsummaryrefslogtreecommitdiff
path: root/src/Interpreter.hs
Commit message (Collapse)AuthorAge
* Support EOneHotTom Smeding2024-11-05
|
* WIP EOneHotTom Smeding2024-11-04
|
* Fix IIxNil warningTom Smeding2024-10-26
|
* Make interpreter debug printing conditionalTom Smeding2024-10-26
|
* DebuggingTom Smeding2024-10-26
|
* Fix interpreter bugTom Smeding2024-10-22
|
* Less warningsTom Smeding2024-10-22
|
* Differentiate ReplicateTom Smeding2024-10-22
|
* TestsTom Smeding2024-10-21
|
* Reverse-by-forward, and checking neural (it's wrong)Tom Smeding2024-10-01
|
* Test neuralTom Smeding2024-09-25
|
* Interpreter typechecks, at the cost of compositionality of RepAcTom Smeding2024-09-22
|
* StuffTom Smeding2024-09-22
|
* Some hackingTom Smeding2024-09-22
|
* A little interpreter accum progressTom Smeding2024-09-16
|
* WIP Accum stuffTom Smeding2024-09-15
|
* 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
|
* Finish Accum implementationTom Smeding2024-09-11
|
* WIP interpreterTom Smeding2024-09-06
generated by cgit v1.2.3-70-g09d2 (git 2.51.0) at 2025-10-27 00:30:43 +0100