Cinnamons: A Computation Model Underlying Control Network Programming

TL;DR

This paper introduces 'cinnamon', a new theoretical computation model that underpins Control Network Programming, combining declarative and imperative features with built-in search, and demonstrates its Turing-completeness.

Contribution

It rigorously defines the syntax and semantics of the cinnamon model, linking it to existing programming paradigms and CNP, and explores future extensions into nondeterminism and fuzziness.

Findings

Cinnamon is Turing-complete.

The model effectively formalizes Control Network Programming.

Potential for extending into nondeterminism and fuzziness.

Abstract

We give the easily recognizable name "cinnamon" and "cinnamon programming" to a new computation model intended to form a theoretical foundation for Control Network Programming (CNP). CNP has established itself as a programming paradigm combining declarative and imperative features, built-in search engine, powerful tools for search control that allow easy, intuitive, visual development of heuristic, nondeterministic, and randomized solutions. We define rigorously the syntax and semantics of the new model of computation, at the same time trying to keep clear the intuition behind and to include enough examples. The purposely simplified theoretical model is then compared to both WHILE-programs (thus demonstrating its Turing-completeness), and the "real" CNP. Finally, future research possibilities are mentioned that would eventually extend the cinnamon programming into the directions of nondeterminism, randomness, and fuzziness.