Dactl: An experimental graph rewriting language
- 31 December 1990
- book chapter
- Published by Springer Nature
- p. 378-395
- https://doi.org/10.1007/bfb0017401
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Implementing term rewrite languages in dactlTheoretical Computer Science, 1990
- A correctness proof for combinator reduction with cyclesACM Transactions on Programming Languages and Systems, 1990
- The specificity rule for lazy pattern-matching in ambiguous term rewrite systemsPublished by Springer Nature ,1990
- LEAN: An intermediate language based on graph rewritingParallel Computing, 1989
- On “on graph rewritings”Theoretical Computer Science, 1987
- Specification of reduction strategies in term rewriting systemsPublished by Springer Nature ,1987
- Term graph rewritingPublished by Springer Nature ,1987
- Transputer-based experiments with the ZAPP architecturePublished by Springer Nature ,1987
- Term rewriting systems with prioritiesPublished by Springer Nature ,1987
- Programming with EquationsACM Transactions on Programming Languages and Systems, 1982