Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes. according to which state has an infinite run. Building the full type hierarchy upon this interpretation of the base type gives a finite semantics for simply-typed lambda-trees. https://chefesquipmenters.shop/product-category/stovetop-espresso-makers/