continue interpreter section

LtuPatternFactory.cabal

@@ -29,6 +29,7 @@ executable LtuPatternFactory
                      , Visitor
                      , Coerce
                      , IdiomBrackets
+                     , Interpreter
                      , DependencyInjection
                      , CheapskateRenderer
                      , CMarkGFMRenderer
@@ -63,6 +64,7 @@ test-suite LtuPatternFactory-Demo
                     , Visitor
                     , Coerce
                     , IdiomBrackets
+                    , Interpreter
                     , DependencyInjection
                     , CheapskateRenderer
                     , CMarkGFMRenderer

README.md

@@ -785,6 +785,11 @@ eval (Let x e1 e2)    = eval e1 >>= \v -> local ((x,v):) (eval e2)
 
 [to be continued]
 
+This section was inspired by ideas presented in [Quick Interpreters with the Reader Monad](https://donsbot.wordpress.com/2006/12/11/quick-interpreters-with-the-reader-monad/).
+
+[Sourcecode for this section](https://github.com/thma/LtuPatternFactory/blob/master/src/Interpreter.hs)
+
+
 ### Composite → SemiGroup → Monoid
 
 >In software engineering, the composite pattern is a partitioning design pattern. The composite pattern describes a group of objects that is treated the same way as a single instance of the same type of object. The intent of a composite is to "compose" objects into tree structures to represent part-whole hierarchies. Implementing the composite pattern lets clients treat individual objects and compositions uniformly.

src/Main.hs

@@ -13,6 +13,7 @@ import           Singleton
 import           Strategy
 import           TemplateMethod
 import           Visitor
+import           Interpreter
 
 main :: IO ()
 main = do
@@ -30,3 +31,4 @@ main = do
   abstractFactoryDemo
   jsonPersistenceDemo
   demoDI
+  interpreterDemo