# Identifiers may be formed from any combination of lower case characters (a-z) 
  # except for the language's keywords: if,def,lambda,true,false,list etc
  a = 5 #assigned to literal/atom
  b = f(a) #assigned to an evaluated value
  c = lambda(x,y,z){ x + y +z } #binding an anonymous function
  d = (lambda (x) { x + x }(100)) # calling an anonymous function "on-the-spot" 

# see test.vlnt for more elaborate examples of functions

def f (x){ #typical function definition
  x + x
}  

def fibo(x){ # an example function : a fibonacci series generator
  # last evaluated element is returned as the value of a function
  if x == 1 or x == 0{
    x
  }
  else{
    fibo(x - 1) + fibo(x - 2)
  }
}

lambda (x,y){ x / y } #anonymous function declaration
lambda (func,x){ func(x) } (f,100) # anonymous function call and a high order function example

a = 10
b = list(5,a,lambda(x){ 3 * x }(5)) 

#Useful list operations: 
#Result argument is the list to append the results to (can be an empty list: list() )
map(function,list)
length(list)
filter(predicate,list)
contains(list,key)

#FOLDS:
#The function argument must be a binary function
#initValue is usually the identity value of the function: 0 for add/sub, 1 for mul/div , true for and , false for or
reduceR(function,list,initialValue) 
reduceL(function,list,initialValue)