- (combinatory logic)
- the constant combinator. A function which, when applied to some value, yields a constant function which always returns that value.
- K = x y. x
- considerate, generous, affectionate
- Class, type, sort, variety.
- a polymorphic logical type theory which has operations over types may have a second tier of typing in which types and operators over them are assigned to kinds.
- see also:
- justified true belief
created 1999/9/16 modified 1999/9/24