Pages that link to "Item:Q4923548"
From MaRDI portal
The following pages link to Essentials of Term Graph Rewriting (Q4923548):
Displaying 12 items.
- On sharing, memoization, and polynomial time (Q1640979) (← links)
- Structure and Properties of Traces for Functional Programs (Q2867898) (← links)
- Intensional Properties of Polygraphs (Q2870314) (← links)
- GETGRATS (Q4923529) (← links)
- Solving Equations by Graph Transformation (Q4923538) (← links)
- Essentials of Term Graph Rewriting (Q4923548) (← links)
- (Q5018495) (← links)
- String Diagram Rewrite Theory I: Rewriting with Frobenius Structure (Q5066951) (← links)
- Functional Logic Programming in Maude (Q5403075) (← links)
- Towards a Systematic Method for Proving Termination of Graph Transformation Systems (Q5403457) (← links)
- Rewriting and Call-Time Choice: The HO Case (Q5458434) (← links)
- Compiling Collapsing Rules in Certain Constructor Systems (Q5743585) (← links)
