From 94938d648e021d2ace0f3b7bf383d256449d619f Mon Sep 17 00:00:00 2001 From: Tom Smeding Date: Fri, 13 Sep 2024 23:07:04 +0200 Subject: 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. --- chad-fast.cabal | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) (limited to 'chad-fast.cabal') 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 -- cgit v1.2.3-70-g09d2