Pages that link to "Item:Q4686604"

The following pages link to Variant-Based Satisfiability in Initial Algebras (Q4686604):

Displaying 21 items.

• Non-disjoint combined unification and closure by equational paramodulation (Q831919) (← links)
• Polite combination of algebraic datatypes (Q2090130) (← links)
• Politeness for the theory of algebraic datatypes (Q2096449) (← links)
• Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) (Q2104541) (← links)
• Symbolic computation in Maude: some tapas (Q2119100) (← links)
• Terminating non-disjoint combined unification (Q2119106) (← links)
• Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
• Programming and symbolic computation in Maude (Q2291818) (← links)
• A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
• Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
• Metalevel algorithms for variant satisfiability (Q2413027) (← links)
• Equational formulas and pattern operations in initial order-sorted algebras (Q2628298) (← links)
• Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
• Built-in Variant Generation and Unification, and Their Applications in Maude 2.7 (Q2817918) (← links)
• Metalevel Algorithms for Variant Satisfiability (Q2827841) (← links)
• (Q5020553) (← links)
• (Q5020960) (← links)
• An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis (Q6052948) (← links)
• Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
• Variants and satisfiability in the infinitary unification wonderland (Q6113018) (← links)
• Optimizing Maude programs via program specialization (Q6175104) (← links)