ConVex

ConVex is a CONcatenative language implemented with VECtorS.

ConVex is implemented in C, compiles to C and inherites 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 a small stack that is used to transfer data from the current word to the next. This stack can overflow and nothing can be done about that.
• Heap overflow. ConVex makes use of the C memory allocator and that one may report that nothing is left. In that case a ConVex program will abort with an error message.
• Stack overflow. ConVex makes use of C functions that manipulate the data buffer. These functions can be recursive and they might overflow the stack. In that case ConVex will abort with an error message. The stack can be made larger without recompiling the program at the expense of heap space.

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 instead of lists, certain algorithms are expressed differently and more efficiently in ConVex than they are in Joy.

The current implementation is not finished yet. When finished, it will be available on GitHub. I just 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.