This is the defensive publication of the open source project, the original site might be more useful: nucleoid.org/tutorial/
Briefly, Nucleoid is a runtime environment that allows declarative programming written in ES6 (JavaScript) syntax. Since statements are declarative, the runtime provides logical integrity and persistency, and it is all possible with enabling plasticity in declarative programming.
Here is a simple example:
>a=1>b=a+2>if(b>10){c=true}
In this case, the runtime receives 3 entries as declarative statements, means a in b = a + 2 represents logical intention, not memory location, so that, running a = 10 on the runtime triggers chain event, and as a result, the runtime automatically changes b to 12 and c to true in order to guarantee logical integrity.
>a=10>b12>ctrue
In this paradigm, the behavior of the runtime defined as general purpose declarative runtime and follows formal logic as a default, but still runs as in transactions and does support majority features of database, so any uncaught exceptions or conflicts with formal logic are rolled back by the runtime.
If by a defensive publication the point is to be able to say that you posted it somewhere, and nothing beyond that, then certainly it qualifies.
I was assuming something beyond that, but given your response I am starting to suspect that it was just posted to be able to say that you posted it. :)
A declarative programming language asserts or retracts declarations.
What does "slipping scalability and plasticity" mean?
A persistent declaration set is a set of declarations that are persistent.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
It's unclear to me what the point of this post is, but I think there are several important aspects you've skipped over.
How do you avoid whole program analysis on the assertion or retraction of any declaration?
If you cannot avoid this, what are the implications for scalability and how useful does plasticity become at run-time.
How do you handle recovery from an uncaught contradiction in the persistent declaration set?
This is the defensive publication of the open source project, the original site might be more useful: nucleoid.org/tutorial/
Briefly, Nucleoid is a runtime environment that allows declarative programming written in ES6 (JavaScript) syntax. Since statements are declarative, the runtime provides logical integrity and persistency, and it is all possible with enabling plasticity in declarative programming.
Here is a simple example:
In this case, the runtime receives 3 entries as declarative statements, means
ainb = a + 2represents logical intention, not memory location, so that, runninga = 10on the runtime triggers chain event, and as a result, the runtime automatically changesbto12andctotruein order to guarantee logical integrity.In this paradigm, the behavior of the runtime defined as general purpose declarative runtime and follows formal logic as a default, but still runs as in transactions and does support majority features of database, so any uncaught exceptions or conflicts with formal logic are rolled back by the runtime.
I don't think this answers any of the questions I asked.
If by a defensive publication the point is to be able to say that you posted it somewhere, and nothing beyond that, then certainly it qualifies.
I was assuming something beyond that, but given your response I am starting to suspect that it was just posted to be able to say that you posted it. :)
A declarative programming language asserts or retracts declarations.
What does "slipping scalability and plasticity" mean?
A persistent declaration set is a set of declarations that are persistent.