Re: Operator overloading?

DO you mean something like the below? The code stays the
same but it is possible to choose a different type of
variable (from BYTE to arbitrary precision).
-marcel
(*
 * LANGUAGE    : ANS Forth with extensions
 * PROJECT     : Forth Environments
 * DESCRIPTION : Hairy floating-point issues
 * CATEGORY    : Demonstration, using of OPG (see also archimedes.frt)
 * AUTHOR      : Marcel Hendrix
 * LAST CHANGE : August 4, 2012, Marcel Hendrix
 * LAST CHANGE : Saturday, December 22, 2012, 22:46, Marcel Hendrix
 *)
NEEDS -xopg
REVISION -archimedes "--- Archimedes' PI      Version 2.01 ---"
PRIVATES
DOC
(*
Round-off error can affect the convergence and accuracy of iterative
numerical procedures. As an example, Archimedes approximated PI by
calculating the perimeters of polygons inscribing and circumscribing
a circle, starting with hexagons, and successively doubling the number
of sides. As noted above, computations may be rearranged in a way that
is mathematically equivalent but less prone to error (numerical
analysis).
Two forms of the recurrence formula for the circumscribed polygon are:
t0 = 1 / sqrt(3)
     sqrt(ti^2+1) - 1
first form:  ti+1 = ----------------
   ti
        ti
second form: ti+1 = ----------------
     sqrt(ti^2+1) + 1
*)
ENDDOC
\ .xfloat.p
 .arbitrary.p
: #SHOW ( -- )
0-VALUE        GLOCAL t0
PI-VALUE       GLOCAL pi
LET SQRT(1/3): GLOCAL ti1
LET SQRT(1/3): GLOCAL ti2
#129 0 DO
  I #15 AND
  0= IF
  CR I 3 .R SPACE
   LET t0=6*ti1*2^DOUBLE[I]:
   LET (t0-PI,t0): .PRINT ."  (err=" .PRINT ." )"
  CR 4 SPACES
   LET t0=6*ti2*2^DOUBLE[I]:
   LET (t0-PI,t0): .PRINT ."  (err=" .PRINT ." )"
  ENDIF
  LET ti1 = (SQRT(ti1*ti1+1)-1)/ti1:
  LET ti2 = ti2/(SQRT(ti2*ti2+1)+1):
     LOOP ;
:ABOUT CR ." Try: #SHOW -- approximates PI using two different
algorithms."
CR ."      PI = " PI-VALUE .PRINT ;
.ABOUT -archimedes CR
DEPRIVE
                              (* End of Source *)