We present a generalisation of first-order unification to the practically important case of
equations between terms involving binding operations. A substitution of terms for variables …

We present a generalisation of first-order unification to the practically important case of
equations between terms involving binding operations. A substitution of terms for variables …

Qu-Prolog is an extension of Prolog which performs meta-level computations over object
languages, such as predicate calculi and λ-calculi, which have object-level variables, and …

For representing high level knowledge, such as the mathematical knowledge used in
interactive theorem provers and veri cation systems, it is desirable to extend Prolog's …

For representing high level knowledge, such as the math-ematical knowledge used in
interactive theorem provers and verification systems, it is desirable to extend Prolog's …

The re nement calculus, based on predicate transformer semantics, is proving useful in the
construction of sequential programs. It is argued that the re nement calculus provides a …