The following pages link to Nachum Dershowitz (Q199247):
Displaying 50 items.
- Orderings for term-rewriting systems (Q593789) (← links)
- Natural termination (Q673622) (← links)
- The cycle lemma and some applications (Q751658) (← links)
- Synthetic programming (Q761788) (← links)
- Leanest quasi-orderings (Q876045) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- The influence of domain interpretations on computational models (Q1036525) (← links)
- Termination of rewriting (Q1098624) (← links)
- Corrigendum to ``Termination of rewriting'' (Q1098625) (← links)
- Ordered trees and non-crossing partitions (Q1103619) (← links)
- (Q1106658) (redirect page) (← links)
- Critical pair criteria for completion (Q1106659) (← links)
- A note on simplification orderings (Q1139374) (← links)
- Enumerations of ordered trees (Q1144044) (← links)
- The Schorr-Waite marking algorithm revisited (Q1146527) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- Completion for rewriting modulo a congruence (Q1262752) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Logical debugging (Q1322853) (← links)
- Artificial intelligence: Retrospective/prospective (Q1601832) (← links)
- Well-founded unions (Q1799073) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Patterns in trees (Q2277475) (← links)
- Zohar Manna (1939--2018) (Q2280208) (← links)
- Drags: a compositional algebraic framework for graph rewriting (Q2422028) (← links)
- A hypercomputational alien (Q2497874) (← links)
- Abstract canonical presentations (Q2500482) (← links)
- (Q2751361) (← links)
- (Q2757839) (← links)
- Universality in two dimensions (Q2804324) (← links)
- (Q2851702) (← links)
- Towards an Axiomatization of Simple Analog Algorithms (Q2898065) (← links)
- Honest universality (Q2941591) (← links)
- Complexity of propositional proofs under a promise (Q2946606) (← links)
- (Q2953133) (← links)
- Res Publica: The Universal Model of Computation (Invited Talk) (Q2958506) (← links)
- Indian Calendrical Calculations (Q3019152) (← links)
- Calendrical Calculations (Q3130582) (← links)
- (Q3148836) (← links)
- (Q3153070) (← links)
- (Q3153941) (← links)
- Axiomatizing Analog Algorithms (Q3188259) (← links)
- (Q3210187) (← links)
- Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers (Q3300679) (← links)
- Honest Computability and Complexity (Q3305319) (← links)
- (Q3338269) (← links)
- Comparing Computational Power (Q3424114) (← links)
- Cayley′s Formula: A Page From The Book (Q4576536) (← links)
- On the parallel computation thesis (Q4644545) (← links)
- Graph Path Orderings (Q5222963) (← links)
