By Topic

High-order functions and their ordering relations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

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.

Published in:

Digital Information Management (ICDIM), 2010 Fifth International Conference on

Date of Conference:

5-8 July 2010