The SL synchronous language, revisited

TL;DR

This paper revisits the SL synchronous programming model, proposing an alternative design with thread spawning and recursion, and analyzes its properties like determinism, reactivity, and expressivity.

Contribution

It introduces a revised SL model with new features and explores its fundamental properties and computational capabilities.

Findings

The revised model supports thread spawning and recursion.

It maintains determinism and reactivity.

The model's expressivity and program equivalence are characterized.

Abstract

We revisit the SL synchronous programming model introduced by Boussinot and De Simone (IEEE, Trans. on Soft. Eng., 1996). We discuss an alternative design of the model including thread spawning and recursive definitions and we explore some basic properties of the revised model: determinism, reactivity, CPS translation to a tail recursive form, computational expressivity, and a compositional notion of program equivalence.