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 CA
Original language | English |
---|
Publication status | Published - 1998 |
---|