Graph-based Implementation of a Functional Logic Language

H. Kuchen, R. Loogen, J.J. Moreno Navarro, M. Rodriguez Artalejo

	   We investigate the development of a graph reduction machine
	   for a higher-order functional logic language by extension
	   of an appropriate architecture for purely functional
	   languages. To execute logic programs the machine must be
	   capable of performing unification and backtracking. We show the
	   integration of these mechanisms in a programmed (functional)
	   graph reduction machine. The new machine has been implemented
	   on a transputer system.