Pages that link to "Item:Q1186735"

The following pages link to Sequentiality in orthogonal term rewriting systems (Q1186735):

Displaying 21 items.

• Strongly sequential and inductively sequential term rewriting systems (Q293294) (← links)
• Root-neededness and approximations of neededness (Q293367) (← links)
• Lazy productivity via termination (Q549188) (← links)
• Constructor equivalent term rewriting systems (Q689634) (← links)
• Strong and NV-sequentiality of constructor systems (Q1029079) (← links)
• A hybrid programming scheme combining fuzzy-logic and functional-logic resources (Q1037954) (← links)
• Semantics and strong sequentiality of priority term rewriting systems (Q1275017) (← links)
• Constructor equivalent term rewriting systems are strongly sequential: A direct proof (Q1338780) (← links)
• Decidable call-by-need computations in term rewriting (Q1763429) (← links)
• Normalization, approximation, and semantics for combinator systems (Q1853619) (← links)
• Sequentiality, monadic second-order logic and tree automata. (Q1854333) (← links)
• Context-sensitive rewriting strategies (Q1854569) (← links)
• Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
• On Term-Graph Rewrite Strategies (Q2873679) (← links)
• A Needed Rewriting Strategy for Data-Structures with Pointers (Q3522009) (← links)
• Optimal solutions to pattern matching problems (Q5044757) (← links)
• Optimal normalization in orthogonal term rewriting systems (Q5055799) (← links)
• Decidable approximations of term rewriting systems (Q5055873) (← links)
• Semantics and strong sequentially of priority term rewriting systems (Q5055874) (← links)
• Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs (Q5214098) (← links)
• Decidable call by need computations in term rewriting (extended abstract) (Q5234682) (← links)