ConVex

ConVex is a CONcatenative language implemented with VECtorS.

ConVex is implemented in C, compiles to C and inherits from C all the deficiencies of C, in one word: Overflow.

• Integer overflow. The sum of two positive integers may be negative. Surprise.
• Buffer overflow. ConVex makes use of small tables that may run out of space. In that case an error message is printed and the program is aborted.
• Heap overflow. ConVex makes use of the C memory allocator and that one may report that no memory is left. In that case an error message is printed and the program is aborted.
• Stack overflow. ConVex makes use of C functions that may be called recursively and that might overflow the stack. In that case the ConVex program will be aborted. It depends on the shell from where the program was started whether or not an error message is displayed.

On the positive side, ConVex can execute Joy programs at a greater speed than an interpreter can do. And because ConVex makes use of vectors in addition to lists, certain algorithms are expressed differently and more efficiently in ConVex than they are in Joy.

The implementation will not be realized. Instead, an approach similar to Joy is used with lists instead of vectors. Only the speed improvement remains. When finished, it will be available on GitHub. I still want to reserve this name, before anyone else takes it. Ah yes, a convex shape can be split anywhere along a straight line and results in two convex shapes.

And this is the link: https://github.com/Wodan58/Moy