How Clean works Computing is based on graph rewriting and reduction. Constants such as numbers are graphs and functions are graph rewriting formulas. This, combined with compiling to native code, makes Clean programs which use high abstraction run relatively fast according to The Computer Language Benchmarks Game. A 2008 benchmark showed that Clean native code performs similarly to the Glasgow Haskell Compiler (GHC), depending on the benchmark.
hoW Clean wORKS ComPUTinG is based oN GRAph rEWritiNg and redUCTioN. constAnts sucH as NUMbers ArE grAphS anD funcTioNS ARe GRaph RewRiTIng ForMulas. tHis, ComBined with COmpiliNG TO NATiVE code, makes clEan progrAms whicH use High aBStRaCtiOn rUn RELATivelY FASt accOrDIng To The CoMPuter LANguage beNChMaRKs GaME. a 2008 BENchmaRK shoWeD that cLeAn nATive cOde PERfoRms SImilArLy to thE glasGoW haskell cOmPIler (GHc), dEpEnding on The BencHmArK.