Difference between revisions of "Clean"
Line 26: | Line 26: | ||
|style="width:25%; vertical-align: top; padding-right: 20px;"| | |style="width:25%; vertical-align: top; padding-right: 20px;"| | ||
== Community == | == Community == | ||
− | Find out what is going on in the Clean community by | + | Find out what is going on in the Clean community by checking out the [[projects]] that use Clean, reading the [[wishlist]] of Clean features, or joining our [[mailing lists]], . |
|style="width:25%; vertical-align: top; padding-right: 20px;"| | |style="width:25%; vertical-align: top; padding-right: 20px;"| | ||
+ | |||
== About == | == About == | ||
Read more about the [[latest developments]], upcoming and past [[events]], or how to [[contact]] us. | Read more about the [[latest developments]], upcoming and past [[events]], or how to [[contact]] us. | ||
|} | |} |
Revision as of 09:06, 6 July 2010
Welcome to the Clean Wiki! The programming language Clean is a general purpose, state-of-the-art, pure and lazy functional programming language designed for making real-world applications. Clean is the only functional language in the world which offers uniqueness typing. This type system makes it possible in a pure functional language to incorporate destructive updates of arbitrary data structures (including arrays) and to make direct interfaces to the outside imperative world. The type system makes it possible to develop efficient applications as well. The Clean System is available for the Windows, Linux, and MacOS operating systems. |
Upcoming events
|
LanguageLearn more about the Clean language by downloading a distribution, or reading the documentation, related publications, or FAQ. |
LibrariesCheck out the official libraries released together with Clean and some of the community libraries developed for Clean. |
CommunityFind out what is going on in the Clean community by checking out the projects that use Clean, reading the wishlist of Clean features, or joining our mailing lists, . |
AboutRead more about the latest developments, upcoming and past events, or how to contact us. |