Entity usage

Showing below up to 37 results in range #1 to #37.

1. An inference system for horn clause logic with equality: Label: en
2. Second-order unification in the presence of linear shallow algebraic equations: Label: en
3. Higher-order unification, polymorphism, and subsorts: Label: en
4. Constrained equational deduction: Label: en
5. An universal termination condition for solving goals in equational languages: Label: en
6. Compatibility of order-sorted rewrite rules: Label: en
7. Equational logics (birkhoff's method revisited): Label: en
8. Unique-sort order-sorted theories : A description as monad morphisms: Label: en
9. A fixed-point semantics for feature type systems: Label: en
10. Typed equivalence, type assignment, and type containment: Label: en
11. Parallel graph rewriting on loosely coupled machine architectures: Label: en
12. A simplifier for untyped lambda expressions: Label: en
13. Design strategies for rewrite rules: Label: en
14. Compiling concurrent rewriting onto the Rewrite Rule Machine: Label: en
15. Implementing term rewriting by graph reduction: Termination of combined systems: Label: en
16. Confluence of the disjoint union of conditional term rewriting systems: Label: en
17. FPL : Functional plus logic programming an integration of the FP and Prolog languages: Label: en
18. On sufficient completeness of conditional specifications: Label: en
19. Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved: Label: en
20. Clausal rewriting: Label: en
21. Linear completion: Label: en
22. Completion procedures as semidecision procedures: Label: en
23. Proof by consistency in conditional equational theories: Label: en
24. Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation: Label: en
25. Completion of first-order clauses with equality by strict superposition: Label: en
26. An application of automated equational reasoning to many-valued logic: Label: en
27. Meta-rule synthesis from crossed rewrite systems: Label: en
28. A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems: Label: en
29. Testing confluence of nonterminating rewriting systems: Label: en
30. Infinite terms and infinite rewritings: Label: en
31. On finite representations of infinite sequences of terms: Label: en
32. Equivalences of rewrite programs: Label: en
33. Conditional rewriting logic: Deduction, models and concurrency: Label: en
34. A proof system for conditional algebraic specifications: Label: en
35. Extended term rewriting systems: Label: en
36. A maximal-literal unit strategy for horn clauses: Label: en
37. Conditional rewriting in focus: Label: en