Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
We dene a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) innite reductions in Conditional Orthogonal ...
Nuprl and HOL are both tactic-based interactive theorem provers for higher-order logic, and both have been used in many substantial applications over the last decade. However, the ...
The frame problem was originally de ned in the context of the situation calculus. The problem also manifests itself in more sophisticated temporal logics that can represent interv...
Abstract. We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational sema...