diff options
| author | Tom Smeding <tom@tomsmeding.com> | 2024-09-13 23:07:04 +0200 |
|---|---|---|
| committer | Tom Smeding <tom@tomsmeding.com> | 2024-09-13 23:07:04 +0200 |
| commit | 94938d648e021d2ace0f3b7bf383d256449d619f (patch) | |
| tree | ef077de27b08027c7117761c3efc7d29b7ad3d56 /chad-fast.cabal | |
| parent | 3d8a6cca424fc5279c43a266900160feb28aa715 (diff) | |
WIP better zero/plus, fixing Accum (...)
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.
Diffstat (limited to 'chad-fast.cabal')
| -rw-r--r-- | chad-fast.cabal | 4 |
1 files changed, 3 insertions, 1 deletions
diff --git a/chad-fast.cabal b/chad-fast.cabal index 6314acd..1b95c66 100644 --- a/chad-fast.cabal +++ b/chad-fast.cabal @@ -15,14 +15,16 @@ library AST.Count AST.Env AST.Pretty + AST.Types AST.Weaken AST.Weaken.Auto CHAD + CHAD.Types -- Compile Data Example Interpreter - Interpreter.Accum + -- Interpreter.AccumOld Interpreter.Rep Language Language.AST |