Abstract
We present an equational verification of Milner's scheduler, which we checked by computer.To
our knowledge this is the first time that the scheduler is proof-checked for a general number n of
scheduled processes.
