From 6d1520e44f0c804c84c9890b341a98afbed40f64 Mon Sep 17 00:00:00 2001 From: Shinya Sato Date: Mon, 21 Feb 2022 22:54:58 +0900 Subject: Update Changelog.md --- Changelog.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'Changelog.md') diff --git a/Changelog.md b/Changelog.md index 5182e7a..cb48545 100644 --- a/Changelog.md +++ b/Changelog.md @@ -5,7 +5,7 @@ #### Polished: * **Bytecode optimisation inspired by Tail Recursive Optimisation**: As a result, this optimisation brings about faster computation up to about twice in comparison with no reuse-annotated computation. - * When an interaction rule has a connection whose both sides agents have the same IDs to the active pair, computation of the connection can be realised by applying the same bytecode sequence of the rule to the connection after replacing ports of active pairs into the agent ports of the connection. Moreover, when the connection is placed at the tail of a connection sequence, we can restart the same bytecode sequence after replacing these ports. For instance, take the following rule for Fibonacci number: + * When an interaction rule has a connection whose both sides agents have the same IDs to the active pair, computation of the connection can be realised by applying the same bytecode sequence of the rule to the connection after replacing ports of the active pair into agent ports of the connection. Moreover, when the connection is placed at the tail of a connection sequence, we can restart the same bytecode sequence after replacing these ports. For instance, take the following rule for Fibonacci number: ``` fib(ret) >< (int n) -- cgit v1.2.3