Prev Up
Go backward to 2.3.4.4 Sorted Terms
Go up to 2.3.4 Terms

2.3.4.5 Conditional Terms

  CONDITIONAL      ::= conditional TERM FORMULA TERM

A conditional term is written:

T1  when  F  else  T2

It is well-sorted for some sort when both T1 and T2 are well-sorted for that sort and F is a well-formed formula. The enclosing atomic formula `A[T1  when  F  else  T2]' expands to:

(A[T1]  if  F)   /\   (A[T2]  if  ¬  F)
When several conditional terms occur in the same atomic formula, the expansions are made in a fixed but arbitrary order (all orders yield equivalent formulae).
CoFI Document: CASL/Summary --Version 0.99-- 21 April 1998.
Comments to cofi-language@brics.dk

Prev Up