## Mindshift: Part 19

Multiplication & Division Having introduced the use of a NUMBER function to represent a signed integer, we've seen how to add and subtract these functions. Now »

Multiplication & Division Having introduced the use of a NUMBER function to represent a signed integer, we've seen how to add and subtract these functions. Now »

Subtraction Using Addition Now that we can work out the SUCCessor and PREDecessor of our special signed functions, we are now in a position to look »

Passing Through Zero (and Surviving!) In the previous blog, we started preparing for the use of abstract functions that can represent signed integers. We did this »

Preparing For Negative Numbers So far in this blog series, our ability to count has been restricted to handling only positive integers. It goes without saying »

Implementing the REDUCE function Now that we have an implementation of the MAP function, its just a small modification to create a REDUCE function. In other »

Functional Cartography:The MAP Function Ok, so what point have we now reached? We're at the point now where we can construct a singly linked list »

Using Functions to Create a Simple List We have now covered two keys areas in functional programming: The ability to use a PAIR function to form »

Divide And Conquer Now that we have the ability to perform recursive functions, we can define a division function. The process of dividing value1 by value2 »

Deriving The Y-Combinator In the previous Mindshift blog, we looked at creating a recursive function using only anonymous functions. However, that function was only capable of »

Recursion Using Only Anonymous Functions Maybe I should start with a warning: Before reading this blog, please ensure that you understand the principles of functional refactoring »