Editing Clean (programming language) (section)

==How Clean works==
Computing is based on [[graph rewriting]] and [[graph reduction|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]].<ref name="benchmarks">{{cite web |title=Which programming languages are fastest? |url=http://shootout.alioth.debian.org/u32/which-programming-languages-are-fastest.php |website=Computer Language Benchmarks Game |url-status=bot: unknown |archive-url=https://web.archive.org/web/20110628185627/http://shootout.alioth.debian.org/u32/which-programming-languages-are-fastest.php |archive-date=28 June 2011}}</ref> A 2008 [[Benchmark (computing)|benchmark]] showed that Clean native code performs similarly to the [[Glasgow Haskell Compiler]] (GHC), depending on the benchmark.<ref>{{Cite FTP |last1=Jansen |first1=Jan Martin |last2=Koopman |first2=Pieter |last3=Plasmeijer |first3=Rinus |date=2008 |title=From Interpretation to Compilation |url=ftp://ftp.cs.ru.nl/pub/Clean/papers/2008/janj08-CEFP07-InterpretationToCompilation.pdf |server=FTP server |url-status=dead |access-date=2016-05-21}}</ref>