Pure
This entry published by the Free Software Foundation.
Pure
http://code.google.com/p/pure-lang/
Pure is a modern-style functional programming language based on term rewriting. It offers equational definitions with pattern matching, full symbolic rewriting capabilities, dynamic typing, eager and lazy evaluation, lexical closures, built-in list and matrix support and an easy-to-use C interface. The interpreter uses LLVM as a backend to JIT-compile Pure programs to fast native code. Pure is closely related to the author's Q language and is slated to eventually become its successor, since it offers many new and powerful features and programs run much faster than their Q equivalents. (OTOH, Q still offers many more library modules right now. Most of these will eventually be ported to Pure, but this will take some time.)
Related Projects
Licensing
| License | Verified by | Verified on | Notes |
|---|---|---|---|
| GPLv3orlater | Kelly Hopkins | 6 November 2008 |
Leaders and contributors
| Contact(s) | Role |
|---|---|
 Albert Graef | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Developer | Download | http://code.google.com/p/pure-lang/downloads/list |
| Developer | Homepage | http://pure-lang.googlecode.com/ |
Software prerequisites
Click here if you'd like to report a problem or make a suggestion that could
This entry (in part or in whole) was last reviewed on 7 November 2008.
Problem with this listing?
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software described in this text has its own copyright notice and license, which can usually be found in the distribution itself.
This page was last modified on 12 April 2011, at 12:23.