Specifying Functional Programs with Intuitionistic First Order Logic

The semantics of LPADs is given in terms of the well founded model [13] of the normal logic programs obtained by selecting one head for each disjunctive clause.. In order to compute

We show that through a subset of this language, called EQL-Lite, we are able to formulate full first-order queries over Description Logic knowledge bases, while keeping

We present a Hoare logic for a call-by-value programming language equipped with recursive, higher-order functions, algebraic data types, and a polymorphic type system in the style

We use Separation Logic with Time Credits, an expressive program logic which allows us to reason about the correctness of functional and imperative higher-order programs, and at

We use Separation Logic with Time Credits, an expressive program logic which allows us to reason about the correctness of functional and imperative higher-order programs, and at