## Section: Overall Objectives

### Highlights of the year

The team has released the Bedwyr model checker that can be used to work with linguistic expressions involving bound variables in a completely declarative fashion. The system comes with several examples, including a declarative and direct implementation of bisimulation checking for the
finite
-calculus. The team has also produced a number of papers on extending and applying the important notion of
*focusing proofs* .