The following pages link to Bernhard Gramlich (Q671505):
Displaying 31 items.
- (Q198024) (redirect page) (← links)
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- A constructor-based approach to positive/negative-conditional equational specifications (Q1332337) (← links)
- Simple termination is difficult (Q1343111) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- (Q2848043) (← links)
- A Framework for Timed Concurrent Constraint Programming with External Functions (Q2867965) (← links)
- Termination of Lazy Rewriting Revisited (Q2873676) (← links)
- Realizing Monads in Interaction Nets via Generic Typed Rules (Q2898063) (← links)
- Transformations of Conditional Rewrite Systems Revisited (Q3184732) (← links)
- Generalizing Newman’s Lemma for Left-Linear Rewrite Systems (Q3527284) (← links)
- (Q4246729) (← links)
- (Q4255514) (← links)
- (Q4289281) (← links)
- (Q4428288) (← links)
- (Q4537514) (← links)
- (Q4809059) (← links)
- (Q4846997) (← links)
- Simple termination is difficult (Q5055798) (← links)
- On proving termination by innermost termination (Q5055854) (← links)
- Confluence of terminating conditional rewrite systems revisited (Q5055864) (← links)
- On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems (Q5111905) (← links)
- On notions of inductive validity for first-order equational clauses (Q5210769) (← links)
- ON (UN)SOUNDNESS OF UNRAVELINGS (Q5389139) (← links)
- Confluence without termination via parallel critical pairs (Q5878911) (← links)
- Sufficient conditions for modular termination of conditional term rewriting systems (Q5881180) (← links)
- A constructor-based approach for positive/negative-conditional equational specifications (Q5881186) (← links)
- On interreduction of semi-complete term rewriting systems (Q5941203) (← links)
