The implicit calculus is interesting as the implicit values are not only resolved by their type, but also referred to by their type and no explicit names are used – for example, implicit 1 in implicit True in (even(?int) && ?bool) evaluates to False where ? is used for implicit type...
Other nodes of the tree use a formalism based on lambda calculus and first-order logic. This sounds very nice and gives very good results for paradigmatic sentences such as “Alice loves Bob”. Furthermore, it is indeed helpful for machines to “understand” text in natural or in controlled...