scientific article; zbMATH DE number 4037157
From MaRDI portal
Publication:3776590
Recommendations
Cited in
(52)- Parallel scheduling of recursively defined arrays
- Conditional rewrite rules: Confluence and termination
- Fast Knuth-Bendix completion with a term rewriting system compiler
- Enumerating outer narrowing derivations for constructor-based term rewriting systems
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- When is an extension of a specification consistent? Decidable and undecidable cases
- Conditional rewriting logic as a unified model of concurrency
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Tight complexity bounds for term matching problems
- Subsumption computed algebraically
- Term-rewriting systems with rule priorities
- An improved bottom-up method for implementing equational programming language
- Equational programming in -calculus via SL-systems. Part 1
- TERM: A parallel executable graph reduction machine for equational language
- Using well-founded relations for proving operational termination
- More efficient left-to-right matching for overlapping pattern
- Unification modulo an equality theory for equational logic programming
- Ternary Equational Languages
- Lazy context cloning for non-deterministic graph rewriting
- Strongly sequential and inductively sequential term rewriting systems
- scientific article; zbMATH DE number 4191131 (Why is no real title available?)
- Finite Basis Theorems for Relatively Congruence-Distributive Quasivarieties
- scientific article; zbMATH DE number 3945331 (Why is no real title available?)
- Implementation of an interpreter for abstract equations
- scientific article; zbMATH DE number 4045106 (Why is no real title available?)
- scientific article; zbMATH DE number 4094872 (Why is no real title available?)
- scientific article; zbMATH DE number 1487858 (Why is no real title available?)
- Optimization by non-deterministic, lazy rewriting
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
- Classes of equational programs that compile into efficient machine code
- Rewriting, and equational unification: the higher-order cases
- Completeness of combinations of constructor systems
- Program transformation and rewriting
- Incremental techniques for efficient normalization of nonlinear rewrite systems
- Open problems in rewriting
- More problems in rewriting
- A semantics for nabla
- Extended term rewriting systems
- Testing confluence of nonterminating rewriting systems
- Efficient tree pattern unification
- Transformations and confluence for rewrite systems
- Modularity in noncopying term rewriting
- Testing for the ground (co-)reducibility property in term-rewriting systems
- Programming in equational logic: Beyond strong sequentiality
- Formalizing the conditionals of Diodorus Cronus and Chrysippus: logic and potential applications in human thinking
- About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus
- Subset-equational programming in intelligent decision systems
- Modular term rewriting systems and the termination
- Implementing term rewrite languages in DACTL
- A rationale for conditional equational programming
- Conditional equational theories and complete sets of transformations
- Programming with narrowing: a tutorial
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776590)
