Implementing term rewrite languages in DACTL (original) (raw)

Dactl is a low-level language of graph rewriting, intended for programming highly Garallel machines. The language includes, but is not restricted to, the limited form of graph rewriting which is commonly used to implement functional language such as Miranda, ML, Hope and Clean. In contrast to these functional languages, where the order in which subterms are evahtated (the ma!uation strategy) is fixed for all programs, in Dactl the evaluation strategy is programmed explicitly. We define a translation of a functional language into Dactl, describe the problems encountered and their solution, and prove that the translation is correct.