Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
The appearance of a rough surface is affected by the direction from which it is lit and texture classifiers should account for this. We propose a classifier that is robust to ligh...
Mike J. Chantler, Ged McGunnigle, A. Penirschke, M...
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch