The following pages link to (Q4385532):
Displaying 50 items.
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,× (Q4988948) (← links)
- ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS (Q5001552) (← links)
- (Q5009706) (← links)
- (Q5018496) (← links)
- Revisiting Semantics of Interactions for Trace Validity Analysis (Q5039546) (← links)
- Associative-commutative discrimination nets (Q5044725) (← links)
- About the theory of tree embedding (Q5044749) (← links)
- Term rewriting in CTΣ (Q5044755) (← links)
- On μ-symmetric polynomials (Q5046095) (← links)
- Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749) (← links)
- Narrowing directed by a graph of terms (Q5055753) (← links)
- Completeness of combinations of constructor systems (Q5055759) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- On fairness of completion-based theorem proving strategies (Q5055773) (← links)
- Proving equational and inductive theorems by completion and embedding techniques (Q5055774) (← links)
- On proving properties of completion strategies (Q5055777) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Bi-rewriting, a term rewriting technique for monotonic order relations (Q5055782) (← links)
- Distributing equational theorem proving (Q5055785) (← links)
- Improving transformation systems for general E-unification (Q5055788) (← links)
- Some lambda calculi with categorical sums and products (Q5055791) (← links)
- Total termination of term rewriting (Q5055796) (← links)
- Simple termination is difficult (Q5055798) (← links)
- Optimal normalization in orthogonal term rewriting systems (Q5055799) (← links)
- AC complement problems: Satisfiability and negation elimination (Q5055807) (← links)
- More problems in rewriting (Q5055812) (← links)
- Automatic termination proofs with transformation orderings (Q5055814) (← links)
- On narrowing, refutation proofs and constraints (Q5055818) (← links)
- Completion for multiple reduction orderings (Q5055819) (← links)
- Concurrent garbage collection for concurrent rewriting (Q5055825) (← links)
- Lazy rewriting and eager machinery (Q5055828) (← links)
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides (Q5055830) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
- Relating two categorical models of term rewriting (Q5055833) (← links)
- (Head-)normalization of typeable rewrite systems (Q5055837) (← links)
- Explicit substitutions with de bruijn's levels (Q5055838) (← links)
- Some independence results for equational unification (Q5055843) (← links)
- Generating polynomial orderings for termination proofs (Q5055845) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Fine-grained concurrent completion (Q5055848) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q5055850) (← links)
- Termination of constructor systems (Q5055852) (← links)
- Dummy elimination in equational rewriting (Q5055853) (← links)
- On proving termination by innermost termination (Q5055854) (← links)
- A recursive path ordering for higher-order terms in η-long β-normal form (Q5055855) (← links)
- Modularity of termination in term graph rewriting (Q5055863) (← links)
- Confluence of terminating conditional rewrite systems revisited (Q5055864) (← links)
- The first-order theory of one-step rewriting is undecidable (Q5055866) (← links)
