Hal algebra

;Notation. Long variable names. ; is comment delimeter
;
Digit = number + base ; Digit cycles on base value
DataStream = Digit + time ; Moving Digits.
Var = DataStream + name ;variable is anything with name
;
; base, time and name have place value of 1.
; Let number = 1 and DataStream = 2, Var = 3
A = Var ;one variable only does name
B = Var ;two variables can do functions.
C = Var ;three variables can do algebra.
;Let Ok, Ik and Rk be names of Variables, k = N
;Functions
O1 = d(I1) ;derivative
O2 = i(I2) ;integral
;...
;algebra
O3 = I3 - R3 ; difference
O4 = I4 + R4 ; sum
O5 = I5 o R5 ; Max(I,R)
O6 = I6 a R6 ; Min(I,R)
;
O7 = I7 is R7 ; If I = R then O = I else O = 0
O8 = I8 gt R8 ; If I > R then O = I else O = 0
O9 = I9 lt R9 ; If I < R then O = I else O = 0
O10 = I10 waseq R10;If I was = R then O = I and M = I else O = M
; wasgt and waslt follow the same path
; these are data stream switches.
O13 = I13 z R13 ;If I = 0 then O = R else O = 0
; have g and l switches of course
O15 = I15 dz R15 ;If d(I) = 0 then O = R else O = 0
; dg and dl too
; There are about 20 node types. That gives you about 20!^base
; Hal Trees different Hal Trees you can make.
; No trees have been made here except size 1 trees.
END