aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorShinya Sato <shinnya.sato@gmail.com>2022-04-16 21:42:25 +0900
committerShinya Sato <shinnya.sato@gmail.com>2022-04-16 21:42:25 +0900
commit23b8283047bc2b866e5edc3c3852ff0bf461a587 (patch)
tree2b9cff1f077a4a05dbe90c6bc233e61b03897087 /README.md
parent5139486fd68973703b8a68b118eff2ef78def144 (diff)
downloadinpla-23b8283047bc2b866e5edc3c3852ff0bf461a587.tar.gz
inpla-23b8283047bc2b866e5edc3c3852ff0bf461a587.zip
v0.8.1-2
Diffstat (limited to 'README.md')
-rw-r--r--README.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/README.md b/README.md
index b049c28..d251348 100644
--- a/README.md
+++ b/README.md
@@ -6,7 +6,7 @@
Inpla is a multi-threaded parallel interpreter of interaction nets. Once you write programs for sequential execution, it works also in multi-threaded parallel execution. Each thread is managed on each CPU-core with POSIX-thread library.
-* The current version is 0.8.1-1 (minor update) released on **10 March 2022**. (See [Changelog.md](Changelog.md) for details.)
+* The current version is 0.8.1-2 (minor update) released on **16 April 2022**. (See [Changelog.md](Changelog.md) for details.)
![speedup-ratio](pic/benchmark_reuse_v0.8.1.png)
@@ -29,7 +29,7 @@ Inpla is a multi-threaded parallel interpreter of interaction nets. Once you wri
- "fib 38" is computation to get the 38th Fibonacci number.
- - "bsort *n*", "isort *n*", "qsort *n*" and "msort *n*" are computation of bubble sort, insertion sort, quick sort and merge sort for random *n*-element lists, respectively. The blanks in OCaml are due to error: `Stack overflow during evaluation (looping recursion?).`
+ - "bsort *n*", "isort *n*", "qsort *n*" and "msort *n*" are computation of bubble sort, insertion sort, quick sort and merge sort for random *n*-element lists, respectively. The blanks in OCaml are due to the following error: `Stack overflow during evaluation (looping recursion?).`