Author:
Barendregt H. P.,Eekelen M. C. J. D.,Glauert J. R. W.,Kennaway J. R.,Plasmeijer M. J.,Sleep M. R.
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Barendregt, H.P., Eekelen, M.C.J.D. van, Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R., “Term Graph Reduction”, these proceedings, 1987.
2. Brus, T., Eekelen, M.C.J.D. van, Leer, M. van, Plasmeijer, M.J., “Clean — A Language for Functional Graph Rewriting”, University of Nijmegen, Internal Report nr. 95, February 1987.
3. Eekelen, M.C.J.D. van, Plasmeijer, M.J., “Specification of rewriting strategies in Term Rewriting Systems”, University of Nijmegen, Workshop on Graph Reduction, Santa Fe, 1986.
4. Glauert, J.R.W., Kennaway, J.R., Sleep, M.R., “DACTL: A Computational Model and Compiler Target Language Based on Graph Reduction”, University of East Anglia 1987, Internal Report SYS-C87-03.
5. Jansen, T, “Interpreting Lean”, Masters thesis, University of Nijmegen, may 1987.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Why Functional Programming Matters to Me;Lecture Notes in Computer Science;2013
2. Complexity Analysis by Graph Rewriting;Functional and Logic Programming;2010
3. Rank 2 Types for Term Graph Rewriting;Electronic Notes in Theoretical Computer Science;2003-02
4. Generating irregular partitionable data structures;Theoretical Computer Science;2000-05
5. Relating graph and term rewriting via Böhm models;Applicable Algebra in Engineering, Communication and Computing;1996-09