The following pages link to (Q4414739):
Displaying 11 items.
- Type-based homeomorphic embedding for online termination (Q989516) (← links)
- Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- Efficient and flexible access control via Jones-optimal logic program specialisation (Q2271897) (← links)
- Rewriting-based repairing strategies for XML repositories (Q2436514) (← links)
- Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (Q3003492) (← links)
- A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (Q3003494) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms* (Q4988927) (← links)
- E-Unification based on Generalized Embedding (Q5084482) (← links)
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (Q5504591) (← links)
