dhall-haskell

d and then afterwards over the result the expression in the first argument to fmap is applied. There is no weird interaction going on here. It's just run this over the result of the loop function if it didn't produce an error. > Even better. How would you go about finding the source code containing the definition of the function `D.subExpressions` ? Use hoogle or just look at the imports at the top of the file. Just like any other programming language. Or even better, use the language server to find it for you. For example there is an import here: `import qualified Dhall.Core as D` Now you know that function is in the `Dhal.Core` module. Going to that module you see the function is not actually there but is exported from the `Dhal.Syntax` module. It took me literally 5 seconds to find it: https://github.com/dhall-lang/dhall-haskell/blob/master/dhal...

ulating or translating arbitrary Brainfuck programs. So, I'm afraid the question in regards to the CPP, is only is limited recursion acceptable for Turing completeness? The Turing-Church thesis specifically states that it should ignore resource limitations, which leads to the question of whether the limited recursion is a result of available resource or the language at hand. There are active debates on this topic, and it cannot be so readily dismissed. However, the point I raised with this, is the claimed safety of Dhall, in that it doesn't guarantee timely normalisation of its terms. Which I believe you may have also noticed. [0] > much like you're unlikely to write a Dhall configuration which takes 10 years to reduce when evaluated. True, however the guarantee of evaluation safety is false. There is no safety there when you can run out the available resource, such as time. And people do insane, unlikely things with a language, such as breaching the type safety of Scala, and in response, they developed DOT calculus, so that they might give those guarantees. Trusting a programmer not to do something stupid, is often the wrong thing to do. [1] There is a line which must be drawn, but you can't make guarantees that mislead the programmer to feel safe. [0] https://github.com/Gabriel439/Haskell-Dhall-Library/issues/6 [1] https://github.com/kanaka/mal/tree/master/awk