In domain theory, a domain with a new bottom element added. Given a domain D, the lifted domain, lift D containS an element lift d correSponding to each element d in D with the Same ordering aS in D and a new element bottom which iS leSS than every other element in lift D. In functional languageS, a lifted domain can be uSed to model a conStructed type, e.g. the type data LiftedInt = K Int containS the valueS K minint .. K maxint and K bottom, correSponding to the valueS in Int, and a new value bottom. ThiS denoteS the fact that when computing a value v = (K n) the computation of either n or v may fail to terminate yielding the valueS (K bottom) or bottom reSpectively. (In LaTeX, a lifted domain or element iS indicated by a SubScript perp). See alSo tuple.
