Remove redundant letters

8 files changed, 0 insertions, 26 deletions

diff --git a/comparison/Inpla/src/bsort-40000-reuse.in b/comparison/Inpla/src/bsort-40000-reuse.in
index 8b6a386..3abd0ec 100644
--- a/comparison/Inpla/src/bsort-40000-reuse.in
+++ b/comparison/Inpla/src/bsort-40000-reuse.in
@@ -11,7 +11,6 @@ B(ret, int x) >< (int y):ys
 
 
 
-
 const LIST_ELEM=40000;
 
 MkRandList(ret) >< (int n)
diff --git a/comparison/Inpla/src/bsort-40000.in b/comparison/Inpla/src/bsort-40000.in
index 0120900..d0a5e1c 100644
--- a/comparison/Inpla/src/bsort-40000.in
+++ b/comparison/Inpla/src/bsort-40000.in
@@ -11,7 +11,6 @@ B(ret, int x) >< (int y):ys
 
 
 
-
 const LIST_ELEM=40000;
 
 MkRandList(ret) >< (int n)
diff --git a/comparison/Inpla/src/fib-38-reuse.in b/comparison/Inpla/src/fib-38-reuse.in
index 6b3d32b..e56fabd 100644
--- a/comparison/Inpla/src/fib-38-reuse.in
+++ b/comparison/Inpla/src/fib-38-reuse.in
@@ -4,13 +4,6 @@ Fib(r) >< (int n)
 | n == 1 => r~1
 | _ => Fib(cnt1)~(n-1), Fib(cnt2)~(n-2), (*L)Add(r,cnt2)~cnt1;
 
-/* Add is realised as built-in.
-Addd(r,n) >< (int m)
-=> Addd2(r,m) ~ n;
-
-Addd2(r,int m) >< (int n)
-=> r~(m+n);
-*/
 
 Fib(r)~38;
 r;
diff --git a/comparison/Inpla/src/fib-38.in b/comparison/Inpla/src/fib-38.in
index a79eb5b..925f5ff 100644
--- a/comparison/Inpla/src/fib-38.in
+++ b/comparison/Inpla/src/fib-38.in
@@ -4,13 +4,6 @@ Fib(r) >< (int n)
 | n == 1 => r~1
 | _ => Add(r,cnt2)~cnt1, Fib(cnt1)~(n-1), Fib(cnt2)~(n-2);
 
-/*
-Addd(r,n) >< (int m)
-=> Addd2(r,m) ~ n;
-
-Addd2(r,int m) >< (int n)
-=> r~(m+n);
-*/
 
 Fib(r)~38;
 r;
diff --git a/comparison/Inpla/src/isort-40000-reuse.in b/comparison/Inpla/src/isort-40000-reuse.in
index 00f0ecc..3e7e2d2 100644
--- a/comparison/Inpla/src/isort-40000-reuse.in
+++ b/comparison/Inpla/src/isort-40000-reuse.in
@@ -18,5 +18,3 @@ MkRandList(ret) >< (int n)
 MkRandList(cnt)~(LIST_ELEM),
 IS(ret)~cnt;
 ret;
-
-
diff --git a/comparison/Inpla/src/isort-40000.in b/comparison/Inpla/src/isort-40000.in
index ff831a3..295f6f4 100644
--- a/comparison/Inpla/src/isort-40000.in
+++ b/comparison/Inpla/src/isort-40000.in
@@ -18,5 +18,3 @@ MkRandList(ret) >< (int n)
 MkRandList(cnt)~(LIST_ELEM),
 IS(ret)~cnt;
 ret;
-
-
diff --git a/comparison/Inpla/src/qsort-800000-reuse.in b/comparison/Inpla/src/qsort-800000-reuse.in
index 8bf7a83..810e446 100644
--- a/comparison/Inpla/src/qsort-800000-reuse.in
+++ b/comparison/Inpla/src/qsort-800000-reuse.in
@@ -7,9 +7,6 @@ QS(ret) >< (int x):xs =>
 
 // Note: `Append' is implemented as built-in.
 
-// Apnd(ret, a)~b  -->  ret ~ b@a
-//Apnd(ret, a) >< [] => ret~a;
-//Apnd(ret, a) >< x:xs => ret~(x:cnt), Apnd(cnt, a)~xs;
 
 Part(int x, a, b) >< [] => a~(*L)[], b~(*R)[];
 Part(int x, a, b) >< (int y):ys
diff --git a/comparison/Inpla/src/qsort-800000.in b/comparison/Inpla/src/qsort-800000.in
index e8913e8..8226655 100644
--- a/comparison/Inpla/src/qsort-800000.in
+++ b/comparison/Inpla/src/qsort-800000.in
@@ -7,9 +7,6 @@ QS(ret) >< (int x):xs =>
 
 // Note: `Append' is implemented as built-in.
 
-// Apnd(ret, a)~b  -->  ret ~ b@a
-//Apnd(ret, a) >< [] => ret~a;
-//Apnd(ret, a) >< x:xs => ret~(x:cnt), Apnd(cnt, a)~xs;
 
 Part(int x, a, b) >< [] => a~[], b~[];
 Part(int x, a, b) >< (int y):ys