The functional logic language BABEL and its implementation on a graph machine |
| |
Authors: | Herbert Kuchen Rita Loogen Juan José Moreno-Navarro Mario Rodríguez-Artalejo |
| |
Affiliation: | 1. Informatik II, RWTH Aachen, D-52056, Aachen, Germany 2. Fachgebiet Informatik, Philipps-Universit?t Marburg, Lahnberge, D-35032, Marburg, Germany 3. Facultad de Informática, Universidad Politécnica de Madrid, Boadilla del Monte, 28660, Madrid, Spain 4. Departamento de Informática y Automática, Facultad de C.C. Matemáticas, Universidad Complutense de Madrid, 28040, Madrid, Spain
|
| |
Abstract: | The first-order, untyped, functional logic language Babel is extended by polymorphic types and higher order functios. 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|