Data commit

Lang/Order/00-LANG.txt

@@ -0,0 +1,23 @@
+{{language
+|exec=interpreted
+|gc=yes
+|safety=unsafe
+|checking=dynamic
+|parampass=value
+|hopl=no}}
+{{language programming paradigm|Declarative}}
+{{language programming paradigm|functional}}
+
+'''Order''' is a high-level, functional programming language implemented entirely using the [[C]] preprocessor. It provides a full programming language for [[metaprogramming]] in C (or any other environment where the C preprocessor can be used). A debugging environment and line-by-line evaluator are also included. Rather than building a library of macros to solve specific metaprogramming problems individually, Order-PP implements a continuation-based virtual machine which then interprets the high-level Order language.
+
+Order is based primarily on lambda calculus, and is vaguely similar in semantics to languages such as ML or [[Scheme]], offering first-class functions with partial application, lexical scope, first-class continuations, arbitrary-precision arithmetic, and built-in operators for compound types.
+
+Order requires some components from its sister project, Chaos (included in the download), to also be installed, although it is not primarily based on it. Order also requires a standard-conforming [[C99]] preprocessor, and has absolutely no workarounds for non-conformance - currently, only [[GCC]] is confirmed to work with all examples.
+
+==See Also==
+* [http://chaos-pp.cvs.sourceforge.net/viewvc/chaos-pp/?view=tar Official download (Chaos, includes Order)]
+
+The SourceForge repo seems to not be working anymore. You can also download from Github.
+
+* [https://github.com/rofl0r/chaos-pp Github (Chaos, includes Order)]
+* [https://github.com/rofl0r/order-pp Github (Order standalone)]

Lang/Order/00-META.yaml

@@ -0,0 +1,2 @@
+---
+from: http://rosettacode.org/wiki/Category:Order

Lang/Order/99-bottles-of-beer

@@ -0,0 +1 @@
+../../Task/99-bottles-of-beer/Order

Lang/Order/A+B

@@ -0,0 +1 @@
+../../Task/A+B/Order

Lang/Order/ABC-problem

@@ -0,0 +1 @@
+../../Task/ABC-problem/Order

Lang/Order/Ackermann-function

@@ -0,0 +1 @@
+../../Task/Ackermann-function/Order

Lang/Order/Apply-a-callback-to-an-array

@@ -0,0 +1 @@
+../../Task/Apply-a-callback-to-an-array/Order

Lang/Order/Array-concatenation

@@ -0,0 +1 @@
+../../Task/Array-concatenation/Order

Lang/Order/Factorial

@@ -0,0 +1 @@
+../../Task/Factorial/Order

Lang/Order/Fibonacci-sequence

@@ -0,0 +1 @@
+../../Task/Fibonacci-sequence/Order

Lang/Order/First-class-environments

@@ -0,0 +1 @@
+../../Task/First-class-environments/Order

Lang/Order/FizzBuzz

@@ -0,0 +1 @@
+../../Task/FizzBuzz/Order

Lang/Order/Function-composition

@@ -0,0 +1 @@
+../../Task/Function-composition/Order

Lang/Order/Greatest-common-divisor

@@ -0,0 +1 @@
+../../Task/Greatest-common-divisor/Order

Lang/Order/Hailstone-sequence

@@ -0,0 +1 @@
+../../Task/Hailstone-sequence/Order

Lang/Order/Higher-order-functions

@@ -0,0 +1 @@
+../../Task/Higher-order-functions/Order

Lang/Order/Integer-sequence

@@ -0,0 +1 @@
+../../Task/Integer-sequence/Order

Lang/Order/Least-common-multiple

@@ -0,0 +1 @@
+../../Task/Least-common-multiple/Order

Lang/Order/Loops-For

@@ -0,0 +1 @@
+../../Task/Loops-For/Order

Lang/Order/Luhn-test-of-credit-card-numbers

@@ -0,0 +1 @@
+../../Task/Luhn-test-of-credit-card-numbers/Order

Lang/Order/Mutual-recursion

@@ -0,0 +1 @@
+../../Task/Mutual-recursion/Order

Lang/Order/Partial-function-application

@@ -0,0 +1 @@
+../../Task/Partial-function-application/Order

Lang/Order/Program-name

@@ -0,0 +1 @@
+../../Task/Program-name/Order

Lang/Order/Sierpinski-carpet

@@ -0,0 +1 @@
+../../Task/Sierpinski-carpet/Order

Lang/Order/Sort-an-integer-array

@@ -0,0 +1 @@
+../../Task/Sort-an-integer-array/Order

Lang/Order/Sort-disjoint-sublist

@@ -0,0 +1 @@
+../../Task/Sort-disjoint-sublist/Order

Lang/Order/Sum-of-squares

@@ -0,0 +1 @@
+../../Task/Sum-of-squares/Order

Lang/Order/Y-combinator

@@ -0,0 +1 @@
+../../Task/Y-combinator/Order