zz

Author: chai2010

docs/public/wa-chan/readme.md

@@ -19,7 +19,7 @@
 
 ## 🎨 设计理念
 
-WA酱是凹语言（Wa-lang）的拟人化吉祥物，形象设计结合了二次元萌系风格与现代科技感，以亲和力、可扩展性、自由精神为核心概念，充分展现凹语言的核心特点。
+WA酱是凹语言（The Wa Programming Language）的拟人化吉祥物，形象设计结合了二次元萌系风格与现代科技感，以亲和力、可扩展性、自由精神为核心概念，充分展现凹语言的核心特点。
 
 1️⃣ **科技感配色**：
  主色调采用**浅蓝绿+白色+银灰**，象征凹语言的高效、灵活以及现代感，同时也呼应 WebAssembly 的前沿技术气息。

docs/smalltalk/en/st0060.md

@@ -1,27 +1,27 @@
-# Process of solving the "Parallel ϕ-nodes" problem in Go and Wa-lang
+# Process of solving the "Parallel ϕ-nodes" problem in Go and Wa
 
 Ernan Ding, Shushan Chai
 
 ---
 
-Recently, we (the [Wa-lang](https://github.com/wa-lang/wa) development team), discovered a bug that also exists in Go. It's related to SSA and the process was quite dramatic, as recorded below.
+Recently, we (the [Wa](https://github.com/wa-lang/wa) development team), discovered a bug that also exists in Go. It's related to SSA and the process was quite dramatic, as recorded below.
 
 ## 1. Background introduction
 
-Wa-lang is a general-purpose programming language based on Go, its semantics is quite similar with Go, but designed for WebAssembly. The frontend of Wa-lang (source code to AST) is modified from Go 1.17, AST to SSA conversion uses the `golang.org/x/tools/go/ssa` package, and we write the backend (SSA to Wasm) from scrath.
+Wa (Chinese name "凹", which pronounced "Wa") is a general-purpose programming language based on Go, its semantics is quite similar with Go, but designed for WebAssembly. The frontend of Wa (source code to AST) is modified from Go 1.17, AST to SSA conversion uses the `golang.org/x/tools/go/ssa` package, and we write the backend (SSA to Wasm) from scrath.
 
 SSA (Static Single-Assignment) is an intermediate representation of code, where variables are assigned only once. SSA form helps with program analysis and optimization. For more information, see [https://en.wikipedia.org/wiki/Static_single-assignment_form](https://en.wikipedia.org/wiki/Static_single-assignment_form).
 
-The `golang.org/x/tools/go/ssa` package is a toolkit provided by Go, which provides functions such as converting Go-AST to Go-SSA. Many Go-based language projects are based on or use it, including TinyGo, Go+, etc., as well as Wa-lang. But it is worth noting that **this package is not used for the Go compiler itself**, but is mainly used for external tools such as code analysis.
+The `golang.org/x/tools/go/ssa` package is a toolkit provided by Go, which provides functions such as converting Go-AST to Go-SSA. Many Go-based language projects are based on or use it, including TinyGo, Go+, etc., as well as Wa. But it is worth noting that **this package is not used for the Go compiler itself**, but is mainly used for external tools such as code analysis.
 
 ## 2. Problem appears
 
-Wa-lang recently supports the semantics of Map. However, when we tried to optimize its implementation using binary search tree, the results did not meet expectations. After a day of investigation, we reduced and located the problem code as follows:
+Wa recently supports the semantics of Map. However, when we tried to optimize its implementation using binary search tree, the results did not meet expectations. After a day of investigation, we reduced and located the problem code as follows:
 
 ![](/st0060-01.png)
 
-The left side of the figure is the Wa-lang code, and the right side is the equivalent Go code. 
-According to the program logic, since `root` has been initialized in the `main` function, lines 20 and 24 of the `insert` function should be executed and print the same non-empty value. However, the running results of the above Wa-lang code are as follows:
+The left side of the figure is the Wa code, and the right side is the equivalent Go code. 
+According to the program logic, since `root` has been initialized in the `main` function, lines 20 and 24 of the `insert` function should be executed and print the same non-empty value. However, the running results of the above Wa code are as follows:
 
 ```
 ===
@@ -71,7 +71,7 @@ That is, after leaving the loop body, `y` will be incorrectly assigned to nil. W
 
 Soon after the issue was opened, Alan Donovan closed it. He said that SSA was fine and suggested that we learn the basics of SSA first.
 
-However, we insisted that there was a problem with the `ssa` package. On the one hand, the above SSA code is not long, and its execution logic is not difficult to reason about; more importantly, we found that when the `Interpret()` function of the `ssa/interp` package was used to interpret the above SSA code, `y` was still incorrectly assigned to a nil value, and the printed result was no different from the output of the Wa-lang version! So we submitted these evidence, hoping to reopen the issue.
+However, we insisted that there was a problem with the `ssa` package. On the one hand, the above SSA code is not long, and its execution logic is not difficult to reason about; more importantly, we found that when the `Interpret()` function of the `ssa/interp` package was used to interpret the above SSA code, `y` was still incorrectly assigned to a nil value, and the printed result was no different from the output of the Wa version! So we submitted these evidence, hoping to reopen the issue.
 
 ## 4. Turning point
 
@@ -86,7 +86,7 @@ The problem is here:
     ...
 ```
 
-There are two ϕ-nodes in Block 3. According to the **conventional logic** mentioned earlier, we think the result of the first phi is the input parameter of the second one, and there is a sequence relationship between the execution of the instructions. However, when generating phis, it is based on such an assumption that "**Phis in the same Block are executed in parallel**". That is, `t6` in `phi [0: t1, 1: t6]` should take its value before entering Block 3, rather than the return value of `phi [0: t1, 1: t4]`. According to this assumption, the value of `t7` (i.e. y) is `t6` (i.e. x) of the previous iteration, and the logic is consistent with the intention of the source code. Coincidentally, the Wa-lang compiler and `ssa/interp` made the same mistake - processing phis in serial.
+There are two ϕ-nodes in Block 3. According to the **conventional logic** mentioned earlier, we think the result of the first phi is the input parameter of the second one, and there is a sequence relationship between the execution of the instructions. However, when generating phis, it is based on such an assumption that "**Phis in the same Block are executed in parallel**". That is, `t6` in `phi [0: t1, 1: t6]` should take its value before entering Block 3, rather than the return value of `phi [0: t1, 1: t4]`. According to this assumption, the value of `t7` (i.e. y) is `t6` (i.e. x) of the previous iteration, and the logic is consistent with the intention of the source code. Coincidentally, the Wa compiler and `ssa/interp` made the same mistake - processing phis in serial.
 
 In fact, in previous private discussions, we did consider the possibility that "ϕ-nodes should be executed in parallel":
 
@@ -100,7 +100,7 @@ But the fact that the `interp` package has problems is beyond our expectation.
 Alan Donovan promptly submitted a fix to the `ssa/interp` package:
 [https://go-review.googlesource.com/c/tools/+/621595](https://go-review.googlesource.com/c/tools/+/621595).
 
-We also made a fix to the handling of ϕ-nodes in the Wa-lang: [https://github.com/wa-lang/wa/commit/8138ee420dac88463515328b1edaef99eda43974](https://github.com/wa-lang/wa/commit/8138ee420dac88463515328b1edaef99eda43974).
+We also made a fix to the handling of ϕ-nodes in the Wa: [https://github.com/wa-lang/wa/commit/8138ee420dac88463515328b1edaef99eda43974](https://github.com/wa-lang/wa/commit/8138ee420dac88463515328b1edaef99eda43974).
 
 The test results are correct, so this problem is solved.
 

docs/smalltalk/st0046.md

@@ -50,7 +50,7 @@ global smiley = [8]byte{...}
 #wa:export update
 func Update {
 	wasm4.SetDrawColors(2, 0, 0, 0)
-	wasm4.Text("Hello from Wa-lang!", 10, 10)
+	wasm4.Text("Hello from Wa!", 10, 10)
 
 	gamepad := wasm4.GetGamePad1()
 	if gamepad&wasm4.BUTTON_1 != 0 {

docs/smalltalk/st0069.md

@@ -21,7 +21,7 @@
 
 ## 🎨 设计理念
 
-WA酱是凹语言（Wa-lang）的拟人化吉祥物，形象设计结合了二次元萌系风格与现代科技感，以亲和力、可扩展性、自由精神为核心概念，充分展现凹语言的核心特点。
+WA酱是凹语言（The Wa Programming Language）的拟人化吉祥物，形象设计结合了二次元萌系风格与现代科技感，以亲和力、可扩展性、自由精神为核心概念，充分展现凹语言的核心特点。
 
 1️⃣ **科技感配色**：
  主色调采用**浅蓝绿+白色+银灰**，象征凹语言的高效、灵活以及现代感，同时也呼应 WebAssembly 的前沿技术气息。