Computer Science &Amp; Information Technology (CS &Amp; IT) 2017
DOI: 10.5121/csit.2017.71101
|View full text |Cite
|
Sign up to set email alerts
|

CINNAMONS : A Computation Model Underlying Control Network Programming

Abstract: We give the easily recognizable name "cinnamon" and "cinnamon programming" to

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…4, and let Var = {z,x,y,…}. Let us first consider the function f (2) : N 2 N. It is easy to check that f (2) (7,3) = 4, f (2) (7,7) = 0, f (2) (7,0) = 7, and f (2) (3,7) = 0. f (1) (7) = f (2) (7,0) = 7. f (0) () = f (2) (0,0) = 0. f (3) (7,3,8) = f (2) (7,3) = 4. f (4) (7,3,8,2) = f (2) (7,3) = 4.…”
Section: Formal Semanticsmentioning
confidence: 99%
“…4, and let Var = {z,x,y,…}. Let us first consider the function f (2) : N 2 N. It is easy to check that f (2) (7,3) = 4, f (2) (7,7) = 0, f (2) (7,0) = 7, and f (2) (3,7) = 0. f (1) (7) = f (2) (7,0) = 7. f (0) () = f (2) (0,0) = 0. f (3) (7,3,8) = f (2) (7,3) = 4. f (4) (7,3,8,2) = f (2) (7,3) = 4.…”
Section: Formal Semanticsmentioning
confidence: 99%
“…4, and let Var = {z,x,y,…}. Let us first consider the function f (2) : N 2 N. It is easy to check that f (2) (7,3) = 4, f (2) (7,7) = 0, f (2) (7,0) = 7, and f (2) (3,7) = 0. f (1) (7) = f (2) (7,0 (2) (0,0) = 0. f (3) (7,3,8) = f (2) (7,3) = 4. f (4) (7,3,8,2) = f (2) (7,3) = 4.…”
Section: Informally Varsmentioning
confidence: 99%
“…This paper is an extended version of the conference publication [1] where cinnamons were first introduced. Cinnamons are a model of computation (like Turing machines, recursive functions, while-programs, RAM machines, etc.)…”
Section: Introductionmentioning
confidence: 99%