The functional logic language BABEL and its implementation on a graph machine

@article{Kuchen1996TheFL,
  title={The functional logic language BABEL and its implementation on a graph machine},
  author={Herbert Kuchen and Rita Loogen and Juan Jos{\'e} Moreno-Navarro and Mario Rodr{\'i}guez-Artalejo},
  journal={New Generation Computing},
  year={1996},
  volume={14},
  pages={391-427}
}
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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 36 REFERENCES

Narrowing vs. SLD-Resolution

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

An abstract prolog instruction set

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

A Functional and Logic Programming Language Based on Constructor Discipline and Narrowing

  • J. J. Moreno Navarro
  • cient Lazy Narrowing Using Demandedness Analysis , Symposium PLILP ' 93 , LNCS
  • 1993

SICStus Prolog User''s Manual

VIEW 1 EXCERPT

Compiling Lazy Narrowing into Prolog

  • P. H. Cheong
  • New Generation Computing,
  • 1992
VIEW 1 EXCERPT