Data Structures and Algorithms

    

Algebraic Programming Language

Authors: Sing Kuang Tan

In this paper, I am going to propose a new programming language in mathematical algebraic form. Represent all algorithms in canonical form, that is easy to read, analyze and communicate with other people. Loop invariant, preconditions, post conditions are difficult to use. It can use to derive all properties of algorithms. It can be fed into computer to analyze and manipulate symbolically. Analyze an algorithm sequentially cannot see global pattern in the algorithms, and this is not a long term solution.

Comments: 12 Pages.

Download: PDF

Submission history

[v1] 2022-11-17 03:22:16

Unique-IP document downloads: 350 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus