A compiler for nondeterministic term rewriting systems
From MaRDI portal
Publication:5055858
Recommendations
- Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
- Publication:3028335
- ELAN from a rewriting logic point of view
- scientific article; zbMATH DE number 4092748
- Nondeterministic algebraic specifications and nonconfluent term rewriting
Cites work
- scientific article; zbMATH DE number 1638660 (Why is no real title available?)
- scientific article; zbMATH DE number 4013996 (Why is no real title available?)
- scientific article; zbMATH DE number 4016182 (Why is no real title available?)
- scientific article; zbMATH DE number 1231543 (Why is no real title available?)
- Pattern Matching in Trees
- Programming languages and system architectures. International conference, Zurich, Switzerland, March 2-4, 1994. Proceedings
Cited in
(10)- Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
- scientific article; zbMATH DE number 4092748 (Why is no real title available?)
- Prototyping combination of unification algorithms with the \(\mathsf{ELAN}\) rule-based programming language
- scientific article; zbMATH DE number 4016182 (Why is no real title available?)
- TSFC: A Structure-Preserving Form Compiler
- Compiling a functional logic language: \textit{The Fair Scheme}
- A new functional-logic compiler for Curry: Sprite
- Rewriting logic: Roadmap and bibliography
- The Maude strategy language
- An account of implementing applicative term rewriting
This page was built for publication: A compiler for nondeterministic term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055858)
