1
											2
								3
				4
5
					6
					7
				8

Across 3. A function whose inputs are declared as inputs and none of them should be hidden. The outputs are also declared as outputs.​ 4. This type of programming takes a problem, breaks it down into a series of smaller steps, delivers instructions, and processors execute the solutions at the same time. 5. Easily able to create data structures instead of modifying ones which is already exist. 6. A mechanism that allows functions to “remember” the variables that were present in their outer scope when they were defined. 8. Functions that either take other functions as arguments or return them as results.

Down 1. How can we call expression which can be replaced with its value without changing the program’s behaviour.​ 2. A style of building the structure and elements of computer programs that expresses the logic of a computation without describing its control flow 7. First functional programming language