Category:Pure: Difference between revisions

Official website
Garbage collected:	Yes
Type strength:	Strong;
Type compatibility:	Structural
Type checking:	Dynamic
See Also:	Pure on the HOPL; Pure compared to other languages;

Content added Content deleted

Inline

Latest revision as of 06:57, 28 January 2022

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.

Subcategories

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

@

Pure examples needing attention‎ (empty)
Pure Implementations‎ (empty)
Pure User‎ (3 P)

Pages in category "Pure"

The following 18 pages are in this category, out of 18 total.

1

100 doors

A

C

D

Detect division by zero

F

H

L

Look-and-say sequence

M

N

N-queens problem

P

Prime decomposition

R

@@ Line 1: / Line 1: @@
 {{language|Pure
-|site=http://code.google.com/p/pure-lang/
+|site=https://agraef.github.io/pure-lang//
 |compat=structural
 |checking=dynamic
 |strength=strong
 |gc=yes
-|LCT=yes}}{{language programming paradigm|Dynamic}}{{language programming paradigm|Functional}}{{codepad}}
+|LCT=yes}}{{language programming paradigm|Dynamic}}{{language programming paradigm|Functional}}
-From the official [http://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."
+From the official [https://agraef.github.io/pure-lang/ 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_(term_rewriting)|Wikipedia: Normal form]]
+* [[wp:Pure_(programming_language)|Wikipedia:Pure (programming language)]]