Talk:Clean (programming language)

From Wikipedia, the free encyclopedia

You have new messages (last change).

Might want to include how it's one of the most efficient languages in calculating the Ackermann Function. [1] 70.111.251.203 14:54, 7 March 2006 (UTC)


I see this Fibonacci example often when people try to show off some language's features. But this function is terribly slow! It takes 2^n steps to compute the nth number. It would be enlightening for those who are just starting to look at this language if someone included an actually usable Fibonacci function implementation. (Yes, I know that Fibonacci numbers can be calculated in one step with a single formula, but here I mean an implementation that is usable for any number series in which x_n can be calculated as a function of x_{n-1} and x_{n-2}).


"Delayed evaluation" should probably be replaced by / supplemented by "non-strict evaluation". There should be some more clear separation between language features (e.g., referential transparency) and tools features (e.g., IDE) -- these are entirely separate questions. Developers, etc. should be mentioned. Maybe a comparison with a language like Haskell would be helpful? Is it open-source?

[edit] FOLDOC

someone should incorporate the FOLDOC entry - [2] --Cybercobra 07:05, 15 November 2006 (UTC)

[edit] Benchmark

I removed the claim that Clean performs well on the Computer Language Shootout benchmarks, as, according to this page, it fails all of them.

Also, it's not listed here, which would be the natural page to link to in this context.

chocolateboy 21:30, 12 March 2007 (UTC)

Retrieved from "http://en.wikipedia.org../../../c/l/e/Talk%7EClean_%28programming_language%29_5eae.html"