Caneka aims to unify the fractured programming language space, by reducing the gap between low-level and high-level software engineering.
Caneka has the following tools:
The clarity of the memory-footprint may be useful for analyzing other language runtimes making it an auditor that sits between other langauges or systems.
Most of the efficiency comes from allowing integers and static indexes to be used more often than string interpretation during runtime. Remembring the position of something, without needing the steps you took to find it again can speed things up.
The combination of the Span and the basic type system make retrieving an item from a Lookup structure, built from a simple enum possible throughout the language.
This combined with the simplicity of the re-query based Table for key-value store behavior makes Caneka an easy to understand, light-weight to run, powerful language.
Given that cycles are a better representation of computer processing than objects, there is high potential in this approach to a general purpose programming language.
Computers are usually applied to solve collaborative or evolving problems, the langauge focuses on patterns more than structure, in short, the Array is more powerful than the Object.
The paradigm for this type of software engineering deviates from conventional methodologies using a perspective called Cycle-Oriented Programming.
Caneka is based on a common computer science challenge: "How to handle something, and move on, when the order is not the same". The langauge automatically populates virtual stacks and queues to handle tasks that would otherwise involve extensive handling. Consider the real world example featured in our termination analogy.
In development: the language components are presently in prototype form while we draft a white-paper and seek additional funding. See unit test status on our company site for details.