Category:Pure: Difference between revisions

From Rosetta Code
Content added Content deleted
m (Edit language summary)
m (Link previously broken, new URL placed)
 
(4 intermediate revisions by 4 users not shown)
Line 1:
{{language|Pure
|site=httphttps://codeagraef.googlegithub.com/pio/pure-lang//
|compat=structural
|checking=dynamic
|strength=strong
|gc=yes
|LCT=yes}}{{language programming paradigm|Dynamic}}{{language programming paradigm|Functional}}{{codepad}}
 
From the official [httphttps://agraef.github.io/pure-lang.googlecode.com/svn/docs/pure.html Pure manual]: "Pure is a modern-style functional programming language based on term rewriting. Pure programs are basically collections of equational rules used to evaluate expressions in a symbolic fashion by reducing them to normal form."
 
The Pure interpreter uses LLVM to JIT-compile code; in addition, Pure programs can be compiled with LLVM to machine code as well.
 
==See Also==
* [[wp:Normal_form_Pure_(term_rewritingprogramming_language)|Wikipedia:Pure Normal(programming formlanguage)]]

Latest revision as of 06:57, 28 January 2022

Language
Pure
This programming language may be used to instruct a computer to perform a task.
Official website
Garbage collected: Yes
Type strength: Strong
Type compatibility: Structural
Type checking: Dynamic
See Also:
Listed below are all of the tasks on Rosetta Code which have been solved using Pure.


From the official Pure manual: "Pure is a modern-style functional programming language based on term rewriting. Pure programs are basically collections of equational rules used to evaluate expressions in a symbolic fashion by reducing them to normal form."

The Pure interpreter uses LLVM to JIT-compile code; in addition, Pure programs can be compiled with LLVM to machine code as well.

See Also

Subcategories

This category has the following 3 subcategories, out of 3 total.