An account of implementing applicative term rewriting
From MaRDI portal
Recommendations
Cites work
- A compiler for nondeterministic term rewriting systems
- Compositional verification of asynchronous concurrent systems using CADP
- scientific article; zbMATH DE number 1693507 (Why is no real title available?)
- scientific article; zbMATH DE number 1231501 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1796138 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 2090085 (Why is no real title available?)
- Just-in-time: on strategy annotations
- Maude: specification and programming in rewriting logic
- Refined compilation of pattern-matching for functional languages
Cited in
(5)- Applying string-rewriting to sequence-based specification
- scientific article; zbMATH DE number 4052984 (Why is no real title available?)
- Adaptive non-linear pattern matching automata
- Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
- Adaptive nonlinear pattern matching automata
This page was built for publication: An account of implementing applicative term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866805)