This document is available by FTP in various formats. It was converted to HTML using Hyperlatex 2.3.
CASL is a specification language combining first-order logic, partiality and subsorting. This paper generalizes the CASL logic to higher-order functions and predicates. The logic is presented in a modular step-by-step reduction. Several possible design alternatives are discussed in the light of the need to get a faithful embedding of first-order CASL into higher-order CASL.
The rest of this document has not yet been converted to HTML; please refer to the FTP directory indicated above for the full document.