Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Code accompanying the paper Reflection without Remorse:Revealing a hidden sequence to speed up monadic reflection
Haskell Shell
branch: master
Failed to load latest commit information.
BeforeFix Changes reflecting paper
CPS Update DiffMonad.hs
Data Changes reflecting paper
Fixed Fixing Fixed.Logic being to strict...
DelimCCBenchmark.hs Changes reflecting paper
EffBenchmark.hs Changes reflecting paper
FreeMonadBenchmark.hs
IterateesBench.hs
LICENSE LICENSE
LogicBenchMplus.hs More
LogicBenchReflect.hs Improvements to code
LogicBenchReflectDouble.hs Improvements to code
MCPT.hs Improvements to code
Median.hs More
README.md Reflect readme
TicTacToe.hs Improvements to code
TreeShow.hs Improvements to code
runLogicBench More benchmarking
runtest More benchmarking

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

Something went wrong with that request. Please try again.