4 citations · 7 across the 4 of their papers we have counts for
4 papers
A strong call-by-need calculus
Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond
We present a call-by-need -calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed…
Computer Aided Formal Design of Swarm Robotics Algorithms
Thibaut Balabonski, Pierre Courtieu, Robin Pelle +3
Previous works on formally studying mobile robotic swarms consider necessary and sufficient system hypotheses enabling to solve theoretical benchmark problems (geometric pattern fo…
On the Implementation of Dynamic Patterns
Thibaut Balabonski
The evaluation mechanism of pattern matching with dynamic patterns is modelled in the Pure Pattern Calculus by one single meta-rule. This contribution presents a refinement which n…
A Geometric Approach to the Problem of Unique Decomposition of Processes
Thibaut Balabonski, Emmanuel Haucourt
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar…