FAQ

From Clean
(Difference between revisions)
Jump to: navigation, search
(Added new section: 3. Why do some users call the language "Concurrent Clean?")
Line 13: Line 13:
 
***[http://www.algorithm.com.au/blog/files/36ca9a664954e680edb64d260d763252-350.php Stay Hungry, Stay Foolish - Haskell's Performance | …on Coding | Algorithm.com.au]
 
***[http://www.algorithm.com.au/blog/files/36ca9a664954e680edb64d260d763252-350.php Stay Hungry, Stay Foolish - Haskell's Performance | …on Coding | Algorithm.com.au]
 
***[http://www.google.com/gwt/n?u=http%3A%2F%2Fwww.nabble.com%2FWhy-can%2527t-Haskell-be-faster--td13505750.html Nabble - Haskell - Haskell-Cafe - Why can't Haskell be faster?]
 
***[http://www.google.com/gwt/n?u=http%3A%2F%2Fwww.nabble.com%2FWhy-can%2527t-Haskell-be-faster--td13505750.html Nabble - Haskell - Haskell-Cafe - Why can't Haskell be faster?]
 +
 +
== 3.  Why do some users call the language "Concurrent Clean?" ==
 +
 +
According to [http://en.wikibooks.org/wiki/Concurrent_Clean Concurrent Clean - Wikibooks, collection of open-content textbooks], "'Concurrent' refers to Clean's ability to run the same process on several computers, similar to Ada."
 +
 +
Further, according to [http://osdir.com/ml/lang.clean/2006-03/msg00030.html History of "Clean Functional Language.": msg#00030],
 +
 +
:We started the work on Clean in 1984, as part of the Parallel Reduction Machine project.
 +
:In the beginning, Clean was meant as an intermediate language.
 +
:The first version was defined and running in 1987.
 +
:Hereafter Clean was turned into a fully featured functional programming language.
 +
:Special features are its Graph Rewriting Semantics (1987, Barendregt, Plasmeijer, Van Eekelen) which is
 +
:still the core semantics of Clean, Eric Nockers strictness analyser (1994, very recently completely
 +
:formally proven to be correct), the uniqueness typing (Smetsers, Barendsen,Plasmeijer), the object I/O
 +
:library (Peter Achten), the concurrent implementation (Marco Kesseler), and, of course the very good
 +
:code generation (John van Groningen).
 +
:There is many more.
 +
:You can find all our papers on the net:
 +
:http://www.cs.ru.nl/st/Onderzoek/Publicaties/publicaties.html
 +
 +
:We had a lot of influence on Haskell (which started in 1987) and later also
 +
:Haskell influenced Clean.
 +
 +
Another reason is that the word "Clean," being a generic adjective, by itself, usually generates too many false positives in a search on the Interent.  Users in other countries who do not speak English and who only know how to search by name would have a hard time in finding Clean if that were its only name.  "Concurrent Clean," however, is much easier to find as a name on the Internet, and can be used even by users in other countries who do not speak English.

Revision as of 12:59, 27 June 2008

1. What is the purpose of Clean?

The purpose of Clean is to serve as a fast, non-strict, purely functional programming language that is easy to optimize. Clean is characterized by lazy evaluation, which means that only arguments that need to be evaluated in a function call are actually evaluated. In addition, Clean functions can be written to use (partially) strict evaluation when necessary. Unlike R6RS Scheme and similar to Haskell, Clean offers pattern-matching, guards, array comprehensions, and a Hindley-Milner style type inferencing scheme . For I/O-related functions, in contrast to Haskell's monads, Clean offers a uniqueness type inferencing system, which allows destructive transformation of state information within a purely functional framework. Clean is useful for writing relatively bug-free programs in fewer lines of code, and for formally proving properties of those programs, thereby often eliminating the need for debugging.

2. What are the advantages of Clean?

Clean has the following advantages over similar functional programming languages:

3. Why do some users call the language "Concurrent Clean?"

According to Concurrent Clean - Wikibooks, collection of open-content textbooks, "'Concurrent' refers to Clean's ability to run the same process on several computers, similar to Ada."

Further, according to History of "Clean Functional Language.": msg#00030,

We started the work on Clean in 1984, as part of the Parallel Reduction Machine project.
In the beginning, Clean was meant as an intermediate language.
The first version was defined and running in 1987.
Hereafter Clean was turned into a fully featured functional programming language.
Special features are its Graph Rewriting Semantics (1987, Barendregt, Plasmeijer, Van Eekelen) which is
still the core semantics of Clean, Eric Nockers strictness analyser (1994, very recently completely
formally proven to be correct), the uniqueness typing (Smetsers, Barendsen,Plasmeijer), the object I/O
library (Peter Achten), the concurrent implementation (Marco Kesseler), and, of course the very good
code generation (John van Groningen).
There is many more.
You can find all our papers on the net:
http://www.cs.ru.nl/st/Onderzoek/Publicaties/publicaties.html
We had a lot of influence on Haskell (which started in 1987) and later also
Haskell influenced Clean.

Another reason is that the word "Clean," being a generic adjective, by itself, usually generates too many false positives in a search on the Interent. Users in other countries who do not speak English and who only know how to search by name would have a hard time in finding Clean if that were its only name. "Concurrent Clean," however, is much easier to find as a name on the Internet, and can be used even by users in other countries who do not speak English.

Retrieved from "http://clean.cs.ru.nl/FAQ"
Personal tools