A compiler for nondeterministic term rewriting systems

DOI10.1007/3-540-61464-8_50zbMATH Open1503.68166OpenAlexW1566084073MaRDI QIDQ5055858FDOQ5055858

Authors: Marian Vittek 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61464-8_50

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

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Cites Work

• Pattern Matching in Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Programming languages and system architectures. International conference, Zurich, Switzerland, March 2-4, 1994. Proceedings
• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• Prototyping combination of unification algorithms with the \(\mathsf{ELAN}\) rule-based programming language
• Title not available (Why is that?)
• TSFC: A Structure-Preserving Form Compiler
• Compiling a functional logic language: \textit{The Fair Scheme}
• A new functional-logic compiler for Curry: Sprite
• The Maude strategy language
• Rewriting logic: Roadmap and bibliography
• An account of implementing applicative term rewriting
• Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories

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)