Interaction nets and term-rewriting systems
From MaRDI portal
Publication:1389438
DOI10.1016/S0304-3975(97)00082-0zbMath0893.68088OpenAlexW1973731760MaRDI QIDQ1389438
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00082-0
Related Items (4)
Recursive Functions with Pattern Matching in Interaction Nets ⋮ Interaction nets for linear logic ⋮ A Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine ⋮ From Functional Programs to Interaction Nets via the Rewriting Calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Modularity in noncopying term rewriting
- Termination of rewriting
- Counterexamples to termination for the direct sum of term rewriting systems
- On termination of the direct sum of term-rewriting systems
- Transfinite reductions in orthogonal term rewriting systems
- Completeness of combinations of constructor systems
- Termination for direct sums of left-linear complete term rewriting systems
- Interaction nets and term rewriting systems (extended abstract)
- Implementation of sub-structuring within an object-oriented framework
This page was built for publication: Interaction nets and term-rewriting systems