The backtracking version of TrafoLa-H is a relational language where each expression may have several or even infinitely many values, and each `function' may produce many results. An interpreter for this language was written in Standard ML with a front end in C. This paper describes the usage of the interpreter.
Reinhold Heckmann / heckmann@absint.com