Monotonic
In domain theory, a function f : D -> C is monotonic (or monotone) if
for all x,y in D,
x <= y
=>
f(x) <= f(y).
("<=" is written in LaTeX as \sqsubseteq).
| < Previous Terms | Terms Containing monotonic | Next Terms > |
| monkey sort monkey up Mono monochrome monoid | continuous function garbage collection monotonic order-embedding Rate monotonic scheduling | MONSTR Montage Monte Carlo monty MOO |
