r/Forth • • Jan 06 '19

Graph theory representation for Forth (Stack Machine) features / constructs?

https://groups.google.com/forum/#!topic/comp.lang.forth/UO2E9xHOq_g
0 Upvotes

1 comment sorted by

-1

u/wengchunkn Jan 07 '19

https://groups.google.com/d/msg/comp.lang.forth/UO2E9xHOq_g/NrzDaqf7DwAJ

Thank you very much for your enlightening and interesting comments.

I am not sure if you wish to emphasize the idea that programming should be more pragmatic rather than theoretical?

I am a Chinese Malaysian. We believe in balance. Practice needs theory and vice versa. I think there have been too much practical work in the Forth world -- not enough theories like those of LISP.

Just an update to my original question:

-- start --

Hypothesis SM1: All mathematical and programming structures can be constructed using graph. As such, they can be constructed using stack machine reverse polish notation.

We may attempt to prove the above by induction.

Firstly, we may prove the generation of natural number. Write an RPN program to generate natural numbers and verify them manually. This is trivial.

Next, write other RPN programs, which can be used to inductively prove other theorems.

Repeat the above until the collection of RPN programs can generate programs automatically, and prove all (observable) physical observations.

-- end --

I think the above hypothesis SM1 is now self contained and well defined.

Comments welcome.