The following pages link to (Q4385532):
Displaying 50 items.
- Strongly sequential and inductively sequential term rewriting systems (Q293294) (← links)
- Extending reduction orderings to ACU-compatible reduction orderings (Q293311) (← links)
- Paramodulation with non-monotonic orderings and simplification (Q352977) (← links)
- Semantic types and approximation for Featherweight Java (Q387991) (← links)
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Derived semidistributive lattices (Q607453) (← links)
- A formal library of set relations and its application to synchronous languages (Q654904) (← links)
- 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)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← 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)
- The Hydra battle and Cichon's principle (Q734036) (← links)
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Algebraic specification of agent computation (Q814896) (← links)
- Algebraic simulations (Q844884) (← 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 rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Some classes of term rewriting systems inferable from positive data (Q924174) (← links)