Signed-off-by: Jim Pryor <profjim@jimpryor.net>
<http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps>
<http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps>
-Evaluation strategies and Normalization
+Evaluation Strategies and Normalization
=======================================
In the assignment we asked you to reduce various expressions until it wasn't possible to reduce them any further. For two of those expressions, this was impossible to do. One of them was this:
=======================================
In the assignment we asked you to reduce various expressions until it wasn't possible to reduce them any further. For two of those expressions, this was impossible to do. One of them was this:
+Even with a fold-based representation of numbers, and pred/equal/subtraction, some recursive functions are going to be out of our reach.
+
+Need a general method, where f(n) doesn't just depend on f(n-1) or (f(n-1),f(n-2),..). Fibonacci can be done without Y.
+Ackermann function would need Y, but surely we can find some simpler demonstration?
How to do with recursion with omega.
How to do with recursion with omega.