GitHub - atzeus/reflectionwithoutremorse: Code accompanying the paper Reflection without Remorse:Revealing a hidden sequence to speed up monadic reflection

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

Name		Name	Last commit message	Last commit date
Latest commit History 63 Commits
BeforeFix		BeforeFix
CPS		CPS
Data		Data
Fixed		Fixed
DelimCCBenchmark.hs		DelimCCBenchmark.hs
EffBenchmark.hs		EffBenchmark.hs
FreeMonadBenchmark.hs		FreeMonadBenchmark.hs
IterateesBench.hs		IterateesBench.hs
LICENSE		LICENSE
LogicBenchMplus.hs		LogicBenchMplus.hs
LogicBenchReflect.hs		LogicBenchReflect.hs
LogicBenchReflectDouble.hs		LogicBenchReflectDouble.hs
MCPT.hs		MCPT.hs
Median.hs		Median.hs
README.md		README.md
TicTacToe.hs		TicTacToe.hs
TreeShow.hs		TreeShow.hs
runLogicBench		runLogicBench
runtest		runtest

Provide feedback