Abstract
In the setting of μCRL, the notions of 'linear process operator (LPO)' and 'invariant'
are implemented in Coq, which is a proof development tool based on type theory.
As a first experiment we have computer-checked a general property of a binary search
program in the new framework.
