This package contains the basic algorithms that are used during the search for an activated binding. Classes and interfaces remain very abstract here: We talk about things that may be searched and things that may be executed, but do not give any concrete examples.

The main class here is the `Searcher`, which coordinates various `Binder`s and notifies a `Finder` once a suitable binding of a `Searchable` is found. Then `Executable`s are built from the `Occurrence`s that are involved in the binding.