Rename types (closes #237)

Author: python-processing-unit

README.md

@@ -9,17 +9,17 @@ Prefix is a programming language focused on explicit, readable code.
 ! predicts the next value.
 
 ! ---------- modular inverse via the extended Euclidean algorithm ----------
-FUNC INT modinv(INT a, INT m){
+func int modinv(int a, int m){
     a = MOD(a, m)
     IF(LT(a, 0d0)){ a = +(a, m) }
-    INT r0 = m
-    INT r1 = a
-    INT t0 = 0d0
-    INT t1 = 0d1
+    int r0 = m
+    int r1 = a
+    int t0 = 0d0
+    int t1 = 0d1
     WHILE(NEQ(r1, 0d0)){
-        INT q = /(r0, r1)
-        INT nr = -(r0, *(q, r1))
-        INT nt = -(t0, *(q, t1))
+        int q = /(r0, r1)
+        int nr = -(r0, *(q, r1))
+        int nt = -(t0, *(q, t1))
         r0 = r1
         r1 = nr
         t0 = t1
@@ -28,27 +28,27 @@ FUNC INT modinv(INT a, INT m){
     IF(NEQ(r0, 0d1)){
         THROW("modinv: arguments not coprime")
     }
-    INT inv = MOD(t0, m)
+    int inv = MOD(t0, m)
     IF(LT(inv, 0d0)){ inv = +(inv, m) }
     RETURN(inv)
 }
 
 ! ---------- the hidden LCG (the secret being cracked) ----------
 ! x_{n+1} = (a * x_n + c) mod m
 ! The modulus is kept below 2^31 so that products of two consecutive
-! differences (each < m) never overflow Prefix's signed 64-bit INT.
-INT m = 0x186A1
-INT a = 0d16807
-INT c = 0d12345
-INT seed = 0d48271
+! differences (each < m) never overflow Prefix's signed 64-bit int.
+int m = 0x186A1
+int a = 0d16807
+int c = 0d12345
+int seed = 0d48271
 
-FUNC INT step(INT s){
+func int step(int s){
     RETURN(MOD(+( *(a, s), c), m))
 }
 
 ! ---------- collect observed outputs (all the attacker sees) ----------
-MAP obs
-INT s = seed
+map obs
+int s = seed
 FOR(i, 0d8){
     obs<i> = s
     s = step(s)
@@ -60,17 +60,17 @@ DEL("s")
 ! t_i = x_{i+1} - x_i  follows  t_{i+1} = a * t_i (mod m), so each
 ! u_k = t_{k+1} * t_{k-1} - t_k^2 is a multiple of m.  GCD of several
 ! |u_k| yields m.
-MAP d
+map d
 FOR(i, 0d7){
     d<i> = -(obs<+(i, 0d1)>, obs<i>)
 }
 
-INT mrec = 0d0
-INT k = 0d2
+int mrec = 0d0
+int k = 0d2
 WHILE(LTE(k, 0d6)){
-    INT lo = -(k, 0d1)
-    INT hi = +(k, 0d1)
-    INT tk = d<k>
+    int lo = -(k, 0d1)
+    int hi = +(k, 0d1)
+    int tk = d<k>
     mrec = GCD(mrec, ABS(-( *(d<hi>, d<lo>), *(tk, tk) )))
     k = +(k, 0d1)
 }
@@ -80,11 +80,11 @@ DEL("k")
 ! ---------- recover a and c ----------
 ! a = (x2 - x1) * (x1 - x0)^{-1}  (mod m)
 ! c = x1 - a * x0                  (mod m)
-INT x0 = obs<0d1>
-INT x1 = obs<0d2>
-INT x2 = obs<0d3>
-INT arec = MOD(*( -(x2, x1), modinv(-(x1, x0), mrec) ), mrec)
-INT crec = MOD(-(x1, *(arec, x0)), mrec)
+int x0 = obs<0d1>
+int x1 = obs<0d2>
+int x2 = obs<0d3>
+int arec = MOD(*( -(x2, x1), modinv(-(x1, x0), mrec) ), mrec)
+int crec = MOD(-(x1, *(arec, x0)), mrec)
 IF(LT(arec, 0d0)){ arec = +(arec, mrec) }
 IF(LT(crec, 0d0)){ crec = +(crec, mrec) }
 DEL("r0")
@@ -100,8 +100,8 @@ DEL("x1")
 DEL("modinv")
 
 ! ---------- verify by regenerating the whole sequence ----------
-INT ok = 0d1
-INT v = x0
+int ok = 0d1
+int v = x0
 FOR(i, 0d8){
     IF(NEQ(v, obs<i>)){
         ok = 0d0
@@ -117,8 +117,8 @@ PRINT("cracked: m=", mrec, " a=", arec, " c=", crec)
 PRINT("sequence reproduced: ", ok)
 
 ! ---------- predict the next output ----------
-INT next_pred = MOD(+( *(arec, obs<0d8>), crec), mrec)
-INT next_true = step(obs<0d8>)
+int next_pred = MOD(+( *(arec, obs<0d8>), crec), mrec)
+int next_true = step(obs<0d8>)
 DEL("obs")
 DEL("step")
 PRINT("next output predicted: ", next_pred)

docs/CHANGELOG.html

@@ -33,9 +33,9 @@
 ### Minor-level changes
 
 - Add operator `REFUTE`.
-- Add operator `ISMAP`.
-- Add operator `ISFUNC`.
-- Add operator `ISTHR`.
+- Add operator `ismap`.
+- Add operator `isfunc`.
+- Add operator `isthread`.
 - Allow `1` at ident start.
 - Update ident name rules.
 - Document `path` stdlib module.
@@ -55,33 +55,33 @@
 
 Add a PowerShell-based automated test suite and run it in CI.
 
-Fix `IADD` so coercing `NaN` and infinities to `INT` fails instead of succeeding.
+Fix `IADD` so coercing `NaN` and infinities to `int` fails instead of succeeding.
 
 Fix `PAUSE` and its tests.
 
 Fix `PARALLEL`.
 
 Fix serialization and deserialization.
 
-Make `MATCH` reject non-`INT` flags and accept later keyword arguments even when earlier optional ones are absent.
+Make `MATCH` reject non-`int` flags and accept later keyword arguments even when earlier optional ones are absent.
 
-Make `WARN` reject empty calls and arguments that cannot be converted with `~STR`, and improve the empty-call error message.
+Make `WARN` reject empty calls and arguments that cannot be converted with `~str`, and improve the empty-call error message.
 
-Make `PRINT` reject empty calls and arguments that cannot be converted with `~STR`.
+Make `PRINT` reject empty calls and arguments that cannot be converted with `~str`.
 
 Reject multiple statements on one logical line.
 
 Make `STRIP` treat `remove` as a substring rather than a character list, and reject an empty `remove` value.
 
 Make `REPLACE` reject an empty `old` value.
 
-Make `IN` reject tensor operands that are not `TNS` values.
+Make `IN` reject tensor operands that are not `tensor` values.
 
-Make `STR` reject invalid operand types.
+Make `str` reject invalid operand types.
 
 Make `KEYIN` reject invalid key types.
 
-Make `BNOT` fail on non-binary `INT` values.
+Make `BNOT` fail on non-binary `int` values.
 
 Make `THROW` concatenate its arguments.
 
@@ -93,7 +93,7 @@
 
 Fix `PARFOR` pointer writeback.
 
-Fix tensor operator handling of `MAP` and `THR` values.
+Fix tensor operator handling of `map` and `thread` values.
 
 Make `MOD` stop overwriting a pointer passed as its second operand.
 
@@ -163,19 +163,19 @@
 
 ### Major-level changes
 
-Add the first-class `BOOL` type with the `TRUE` and `FALSE` literals, and change the language's Boolean model to use `BOOL` rather than integer sentinel values.
+Add the first-class `bool` type with the `TRUE` and `FALSE` literals, and change the language's Boolean model to use `bool` rather than integer sentinel values.
 
-Change built-in and standard-library APIs that previously returned `INT` sentinel values to return `BOOL` instead, including logical, comparison, type-checking, import, filesystem, console, freeze, and deletion operators, along with helpers such as `prime.IS_PRIME`, `prime.IS_MERSENNE_PRIME`, and `image.SHOW`.
+Change built-in and standard-library APIs that previously returned `int` sentinel values to return `bool` instead, including logical, comparison, type-checking, import, filesystem, console, freeze, and deletion operators, along with helpers such as `prime.IS_PRIME`, `prime.IS_MERSENNE_PRIME`, and `image.SHOW`.
 
 ### Minor-level changes
 
-Bind `SELF` when calling `FUNC` values stored in `MAP` objects, preserving aliasing when the map is accessed through a pointer.
+Bind `SELF` when calling `func` values stored in `map` objects, preserving aliasing when the map is accessed through a pointer.
 
 Update pointer semantics so transformed built-in results write back through pointer operands, and pointer arguments to user-defined functions bind as aliases.
 
 ### Patch-level changes
 
-Allow `BOOL` values in conversions, truthiness, tensor elements, serialization, deserialization, printing, and default `FUNC` returns.
+Allow `bool` values in conversions, truthiness, tensor elements, serialization, deserialization, printing, and default `func` returns.
 
 Fix image save operators to report runtime failures correctly.
 
@@ -221,7 +221,7 @@
 
 Complete `GOTO` implementation.
 
-Ban implicit `MAP` returns from `FUNC`.
+Ban implicit `map` returns from `func`.
 
 Ban non-ASCII chars from source code.
 
@@ -239,19 +239,19 @@
 
 Make `FOR` counter loop-local.
 
-Ban `RETURN` from outside `FUNC`.
+Ban `RETURN` from outside `func`.
 
 Fix [specification 9.2.3](https://python-processing-unit.github.io/Prefix/SPECIFICATION.html#923-conditional-statements).
 
-Fix `MAP`'s Boolean representation.
+Fix `map`'s Boolean representation.
 
 Ban invalid `^`.
 
 Ban incorrect bracket kinds.
 
 Fix [specification section 4.4.1](https://python-processing-unit.github.io/Prefix/SPECIFICATION.html#441-tensor-literals).
 
-Restrict `GOTOPOINT` to `STR` and positive `INT`.
+Restrict `GOTOPOINT` to `str` and positive `int`.
 
 Require parentheses for `CONTINUE`.
 
@@ -281,7 +281,7 @@
 
 Allow symbol creation via `ASSIGN`.
 
-Allow `DEL` calls on `MAP` indexes.
+Allow `DEL` calls on `map` indexes.
 
 Fix `-source` mode module name.
 
@@ -311,7 +311,7 @@
 
 ### Major-level changes
 
-Convert `INT` and `FLT` from binary types to support multiple bases.
+Convert `int` and `float` from binary types to support multiple bases.
 
 ### Minor-level changes
 
@@ -339,7 +339,7 @@
 
 ### Patch-level changes
 
-Convert `MAP` to use a hash table for performance.
+Convert `map` to use a hash table for performance.
 
 ---
 
@@ -377,15 +377,15 @@
 
 ### Major-level changes
 
-Make `TNS` and `MAP` atomic.
+Make `tensor` and `map` atomic.
 
 ### Minor-level changes
 
 N/A
 
 ### Patch-level changes
 
-Fix `FUNC` handling in `SIGNATURE`.
+Fix `func` handling in `SIGNATURE`.
 
 ---
 
@@ -397,9 +397,9 @@
 
 ### Minor-level changes
 
-Add `FLT` infinities.
+Add `float` infinities.
 
-Add `FLT` NaN.
+Add `float` NaN.
 
 ### Patch-level changes