Repository files navigation

SID was originally conceived to try out two concepts:

• Automatic paralellization through dependency analysis as part of compilation.
  • Unless a function is declared to be sequential the compiler will detectdependencies between its invocations (mainly detected using the local scopeand arguments) and set as much of it in parallel as possible. When this hasbeen done for the whole application possibly parallel execution can begrouped into sequential chains of the length that best matches theperformance cost of synchronizing between threads (configurable).
• A soft type system based on set theory (if a value is in the set it matchesthe type constraint).
  • While unions of binary representations are allowed you have to usematchto get the current binary representation before operating on it.
  • Filter operations to modify the sets in ways the compiler can easily reasonabout are provided, such as forbidding a set of values or only allowingvalues above/below a given value.

It has thereafter grown to have another goal:

• Define a very simplified semi-low-level assembly, intended to offer CPUs morefreedom to optimise the execution.