Monica: a lazy functional programming language written in Prolog

or select an example: none 1+2 x->x x->x+1 (x->x+1):2 inc := x->x+1 inc(x) := x+1 | inc inc(x) := x+1 | inc(3) add(x,y) := x+y | add add(x,y) := x+y | add(1) f(1) where f(x) := sin(x) f(1) where f := sin f(1) where f := (x->x+1) take(10, from(0)) map(f, take(10, from(0))) where f := *(2) map(halve, 1..10) where halve:=twiddle(/(2)) [ (a,b) | a <- 1..5; b <- 1..a; even(b) ] f(0) := 1; f(n) := n*f(n-1) | f(8) fix(f->n->if n=0 then 1 else n*f(n-1)) fix(f->n->if n=0 then 1 else n*f(n-1), 8) take(10, primes) where primes := map(hd, iterate(sieve, from(2))) where sieve(p.xs) := (filter(indivisible, xs) where indivisible(x) := x mod p <> 0) take(10, fib) where fib := fix(f, 1, 1) where f(ff, a, b) := a.ff(b, a+b)

Note: a->b denotes a lambda abstraction and f:x denotes application of f to x, also written f(x).