Code accompanying the paper Reflection without Remorse:Revealing a hidden sequence to speed up monadic reflection
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
BeforeFix
CPS
Data
Fixed
DelimCCBenchmark.hs
EffBenchmark.hs
FreeMonadBenchmark.hs
IterateesBench.hs
LICENSE
LogicBenchMplus.hs
LogicBenchReflect.hs
LogicBenchReflectDouble.hs
MCPT.hs
Median.hs
README.md
TicTacToe.hs
TreeShow.hs
runLogicBench
runtest

README.md

Code accompanying the paper Reflection without Remorse:Revealing a hidden sequence to speed up monadic reflection

This code is organized as follows:

  • The root contains benchmarks, demonstrating how our solution improves performance
  • BeforeFix contains the code of various monads before applying our techniques
  • AfterFix contains the code of the same monads with our techniques applied
  • Data contains various type-aligned sequences
  • CPS contains various continuation passing style constructs

To run the LogicT examples with a two continuation passing implementation do:

cabal install logict