The following pages link to (Q4385532):
Displayed 50 items.
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- A sequential reduction strategy (Q671504) (← links)
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Transformations and confluence for rewrite systems (Q672232) (← links)
- Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
- Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Modularity in noncopying term rewriting (Q673186) (← links)
- Term rewriting and Hoare logic -- Coded rewriting (Q673226) (← links)
- Natural termination (Q673622) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975) (← links)
- Termination is not modular for confluent variable-preserving term rewriting systems (Q674186) (← links)
- Groups with a complemented presentation (Q678835) (← links)
- Using geometric rewrite rules for solving geometric problems symbolically (Q685375) (← links)
- Complete axiomatizations of some quotient term algebras (Q685393) (← links)
- On the complexity of recursive path orderings (Q685537) (← links)
- Algebraic specification of agent computation (Q814896) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- An undecidability result for AGh (Q859845) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- A sound framework for \(\delta\)-rule variants in free-variable semantic tableaux (Q877883) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- The two-way rewriting in action: removing the mystery of Euler-Glaisher's map (Q882113) (← links)
- Tree algebras and varieties of tree languages (Q884456) (← links)
- Termination of rewriting (Q1098624) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- Bubbles in modularity (Q1127335) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- Semantics of order-sorted specifications (Q1185014) (← links)
- Sequentiality in orthogonal term rewriting systems (Q1186735) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Modularity of simple termination of term rewriting systems with shared constructors (Q1199539) (← links)
- Simulation of Turing machines by a regular rewrite rule (Q1199548) (← links)
- Termination and completion modulo associativity, commutativity and identity (Q1199927) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- An improved general \(E\)-unification method (Q1201347) (← links)