Features
Referential transparency - a work, given a equivalent inputs, universally gives a equivalent output. Uniqueness typing system - easily & functionally treat by owning unduplicatable resources like input & output forswearing monads List comprehension - compact, powerful listings generation syntax Guards for clear, concise conditionals Easily-to-utilise Filtered IDE. Portability is almost universally the elementary recompile to trend lines an additional platform, ascribable the high level of abstraction. Automatic garbage collection - one less tool to worry about Higher order functions and Currying Delayed evaluation support allows infinite data structures

Examples
Hello world(Store as hullo.icl):

module hello
Run = "Hello, world!"

Factorial: module factorial
fac Cypher = 1 fac north = north * fac (north-One) // buy a factorial of 10 Run = fac 10

Fibonacci sequence: module fibonacci
taradiddle Nought = 0 tarradiddle One = 1 taradiddle north = story (north - Two) + story (north - One)
Run = tarradiddle 7

Infix operator: (^) infixr Octet :: Int Int -> Int (^) x Nought = 1 (^) 10 north = tenorth * x ^ (n-One)

A nature and severity declaration states that a work occurs as correct associatory infix operator sustaining priority Ogdoad: this states that x*x^(north-One) is same to x*(x^(north-One)) when opposed to (x*x)^(north-One); this operator is pre-defined in the Uncontaminating standard environment.

How Clean works
Computation is according to graph rewriting and reduction. Constants like amounts come graphical record & functions come graphical record rewriting system. This, conjunctive by having compilation to native code, clean computer program comparatively convenient, possibly sustaining high abstraction.

Compiling