diff options
| author | Shinya Sato <shinnya.sato@gmail.com> | 2021-09-25 17:23:34 +0900 |
|---|---|---|
| committer | Shinya Sato <shinnya.sato@gmail.com> | 2021-09-25 17:23:34 +0900 |
| commit | 9ae1eeda8a0e3adcd65e309e50f5c333b32783ea (patch) | |
| tree | 6afc850742ad5c8eef39b2d655bad9dce4e3dc0e /README.md | |
| parent | 882f2dcc46d188b30bfebaa08a33a6f619fdde34 (diff) | |
| download | inpla-9ae1eeda8a0e3adcd65e309e50f5c333b32783ea.tar.gz inpla-9ae1eeda8a0e3adcd65e309e50f5c333b32783ea.zip | |
Update README.md
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -4,7 +4,7 @@ ## What is Inpla -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 runs on each CPU-core with POSIX-thread library. +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.  @@ -597,7 +597,7 @@ In interaction rule definitions, we can specify which agent is reused in the net -### Weak Head Normal Form reduction stragety +### Weak Head Normal Form reduction strategy In this reduction strategy, only connections that have living names are re-written by interaction rules. This is taken for non-terminate computation such as fixed point combinator and process networks. @@ -674,7 +674,7 @@ Electronic Communications of the EASST, Volume 73: Graph Computation Models - Se -# Licence +# License Copyright (c) 2021 [Shinya SATO](http://satolab.com/) Released under the MIT license |