chad-fast/src/CHAD, branch hashable-gadtAn implementation of CHAD, towards performance
https://git.tomsmeding.com/chad-fast/atom?h=hashable-gadt2025-01-28T15:58:51ZPretty-printer that supports extension fields2025-01-28T15:58:51ZTom Smedingt.j.smeding@uu.nl2025-01-28T15:58:51Zurn:sha1:3e04b03acd5e7138e0f6241133585f22ddb73060Add ext field to remaining AST constructors2025-01-27T14:08:02ZTom Smedingt.j.smeding@uu.nl2025-01-27T14:08:02Zurn:sha1:88fae8c2914b805a733b71de58ab672124e6069cWIP accum top-level args2024-11-26T14:25:13ZTom Smedingtom@tomsmeding.com2024-11-26T14:25:13Zurn:sha1:ae2b1b71a91d60d3bd1dfb21fce98c05c1a4fcbbPrepare for introducing top-level args in accum mod2024-11-23T11:12:03ZTom Smedingtom@tomsmeding.com2024-11-23T11:12:03Zurn:sha1:7774da51c532006da82617ce307d136897693280Configuration for CHAD2024-11-14T18:27:57ZTom Smedingtom@tomsmeding.com2024-11-14T18:27:57Zurn:sha1:b8c162ce9cb1faeec621b751fff9aff46e022417Benchmark2024-11-07T22:11:36ZTom Smedingtom@tomsmeding.com2024-11-07T22:11:36Zurn:sha1:92ddb2263ae495c229badcc209c76a1252bd2752Towards a test suite2024-10-07T12:34:27ZTom Smedingt.j.smeding@uu.nl2024-10-07T12:34:27Zurn:sha1:72eddb67bb6f048fc2076184be3a32169026a832WIP better zero/plus, fixing Accum (...)2024-09-13T21:07:04ZTom Smedingtom@tomsmeding.com2024-09-13T21:07:04Zurn:sha1:94938d648e021d2ace0f3b7bf383d256449d619f
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.