We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}] expressing that the coalition of all agents satisfying (x) can ac...
Guido Boella, Dov M. Gabbay, Valerio Genovese, Lee...
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...