TEST
15
matricola: ______________________________
nome (solo se non si ricorda la matricola):
__________________________________
- Define a Scheme function taking as input a list ls and a
predicate P? on its elements, and which returns the list of the
elements of ls satisfying the predicate P?.
- Define in Haskell the data type Unlabelled Binary Tree.
- Define a Scheme Function that takes a list ls
of numbers and a numerical function f and returns the list
obtained by applying f to each element of ls.