Pages that link to "Item:Q1918496"
From MaRDI portal
The following pages link to Comparing curried and uncurried rewriting (Q1918496):
Displaying 14 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Remarks on Thatte's transformation of term rewriting systems (Q1763376) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Layer Systems for Proving Confluence (Q2946770) (← links)
- A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
- Simplifying Algebraic Functional Systems (Q3014941) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Generalized and Formalized Uncurrying (Q3172898) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)
- (Q4553285) (← links)
- Currying of order-sorted term rewriting systems (Q6085707) (← links)