Jungle rewriting: An abstract description of a lazy narrowing machine
From MaRDI portal
Publication:5096278
DOI10.1007/3-540-57787-4_8zbMath1494.68106OpenAlexW1606124317MaRDI QIDQ5096278
Andrea Corradini, Dietmar Wolz
Publication date: 16 August 2022
Published in: Graph Transformations in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-57787-4_8
Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42) Logic programming (68N17)
Cites Work
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Implementing term rewriting by jungle evaluation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Jungle rewriting: An abstract description of a lazy narrowing machine
