High-order functions and their ordering relations

High-order functions are the sole elements in a class of recursive functions. The functions are related to each other through application, i.e., applying a function to an argument yields a value where the argument and the value are also functions. Through Froglingo, a language that exactly takes advantage of high-order functions and their properties, we introduce the method of representing business applications including knowledge management in high-order functions and reasoning according to the ordering relations among the high-order functions.