| Most implemented ILP systems are based on Prolog and hence can take advantage of Prolog's well-defined, efficient mechanisms. However, they also inherit Prolog's limitations. In particular, Prolog is essentially first-order and provides neither higher-order constructs nor declarative meta-programming facilities. Based upon type theory, Escher is a new language that effectively combines the best features of logic and functional programming languages. Escher's programs are equational theories and Escher's computational model is based on rewriting. Hence, Escher offers a unique opportunity to broaden the definition of ILP and to investigate induction in higher-order logics. | |