|
Abstract : |
The first-order, untyped, functional logic language Babel is extended by polymorphic types and higher order functions. A sophisticated incompatibility check which is used to guarantee nonambiguity of BABEL programs is presented. For the implementation of the language, unification and backtracking are integrated in a programmed (functional) graph reduction machine. The implementation of this machine has been used for a comparison between Babel and PROLOG based on the runtimes of some example programs. 1, |
