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.