Keel - Playground
// A simple recursive function
function fib(n) {
if n <= 1 {
return n;
} else {
return fib(n-1) + fib(n-2);
}
}
function main() {
print(fib(25));
let nums = [1,2,3,4,5,6];
print(nums);
for n in nums {
print (n ^ 2);
}
print(nums[1..4]);
let hello = "Hello, World!";
print(hello.uppercase());
print(hello.contains("world"));
print(hello.contains("World"));
}