Dactl: An Experimental Graph Rewriting Language | 25 | 1.99 | 1997 |
Lambda-Definable Term rewriting Systems | 1 | 0.36 | 1996 |
Semagraph: the Theory and Practice of Term Graph Rewriting | 1 | 0.34 | 1995 |
Transformation of Orthogonal Term Rewriting Systems | 1 | 0.39 | 1995 |
Infinitary Lambda Calculi and Böhm Models | 11 | 0.69 | 1995 |
Syntactic Definitions of Undefined: On Defining the Undefined | 12 | 1.03 | 1994 |
Applications of Graph Grammars and Directions for Research | 0 | 0.34 | 1990 |
Graph Rewriting As A Computational Model | 1 | 0.36 | 1989 |
Syntax and informal semantics of DyNe, a parallel language | 4 | 6.53 | 1983 |
Applicative Objects as Processes | 0 | 0.34 | 1982 |
Parallel implementation of functional languages | 0 | 0.34 | 1982 |
Towards a Zero Assignment Parallel Processor | 7 | 2.90 | 1981 |
Applicative caching: Programmer control of object sharing and lifetime in. distributed implementations of applicative languages | 9 | 2.94 | 1981 |
Executing functional programs on a virtual tree of processors | 106 | 12.69 | 1981 |