Abstract
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.
Users
Please
log in to take part in the discussion (add own reviews or comments).