Start creating language semantics to express QoS constraints

[CMCDragonkai]

Consider constraint-based logic programming, and see how some of the qos constraints can be expressed using those languages.

Also control theory may be important here too.

If you could write down some examples in the repo. Pseudo-code basically.

[CMCDragonkai]

Some syntax and operator ideas to start with to encode the semantics:

• https://en.wikipedia.org/wiki/Constraint_logic_programming
• https://en.wikipedia.org/wiki/Linear_temporal_logic (google "linear temporal logic functional reactive programming")
• https://dtai.cs.kuleuven.be/problog/ (I like the idea of overloading operators to work against variables representing distributions)

[CMCDragonkai]

Probably use Haskell syntax as inspiration as well.

[CMCDragonkai]

There may be some "language" prerequisites:

• Lambda calculus
• Combinatory logic https://en.wikipedia.org/wiki/Combinatory_logic
• Graphical linear algebra
• Process algebra (and statecharts and bigraphs...)
• Polymorphism (parametric, and other kinds) - I want to see some usage of polymorphism as the foundation of load-balancing and being able to switch out impls (where in this case impls are real automatons running live).

I'm envisioning a sort of network combinators that preserve constraints, so that constraints can be built up with static type checks. So you cannot write down a QoS constraint contradiction. One must also consider best-effort vs deadlines.

[CMCDragonkai]

@olligobber Please update this with your progress, and close this issue when this is done.