Currently, the core abstraction of this library is ContT r (ST s) a. This loosely follows from the design of Wang, ICFP'19 since we need both the continuation monad and mutable references.
However, since the results are numerically incorrect, (see rad (\x -> x + x) 2 for example), a redesign is in order.
[ ] Formulate a minimal example (a "straight-line" program using ContT combinators directly, e.g. finding the sensitivity of g . f where g and f are fixed), to elucidate the interplay of continuations and mutable references.
Currently, the core abstraction of this library is
ContT r (ST s) a
. This loosely follows from the design of Wang, ICFP'19 since we need both the continuation monad and mutable references.However, since the results are numerically incorrect, (see
rad (\x -> x + x) 2
for example), a redesign is in order.g . f
whereg
andf
are fixed), to elucidate the interplay of continuations and mutable references.