An abstract concurrent machine for rewriting [chapter]

Nachum Dershowitz, Naomi Lindenstrauss
1990 Lecture Notes in Computer Science  
Term rewriting corresponds to reduction in applicative languages; narrowing of terms corresponds to goal reduction in logic languages. An abstract machine is described for rewriting and narrowing. It has been implemented in Flat Concurrent Prolog, but could be coded in any system in which processes are capable of creating other processes and communicating with each other.
doi:10.1007/3-540-53162-9_48 fatcat:zj662ceq6zbfdgod32ckojx4gu