← Back to Learning Demos

AQA-Lite Pure Functional Programming Sandbox

Write AQA-style functional programming pseudocode and test yourself with these challenges.

Task

Output

Click Run to evaluate your code.

Submit Result

Submit checks whether your final output equals the expected value.

Language Guide (AQA-Lite)

Binding: nums = [1,2,3]
Function: add x y = x + y (all functions are curried)
Partial app: addFive = add 5
Pattern matching: f [] = 0, f (x:xs) = ...
Cons operator: x : xs
Operator literals as functions: (+), (*), (==), etc.
Operator sections: (/2) means \x -> x / 2, (2/) means \x -> 2 / x.
Built-ins: map, filter, fold where fold is fold op start list
Last non-empty line is evaluated as the output expression.

Examples:

square x = x * x
nums = [1,2,3]
map square nums

Task Solution