Pages that link to "Item:Q689097"

The following pages link to Programming in equational logic: Beyond strong sequentiality (Q689097):

Displaying 22 items.

• A sequential reduction strategy (Q671504) (← links)
• Transformations and confluence for rewrite systems (Q672232) (← links)
• On abstract normalisation beyond neededness (Q683744) (← links)
• Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
• A rationale for conditional equational programming (Q915429) (← links)
• A refinement of strong sequentiality for term rewriting with constructors (Q1093366) (← links)
• The development of a partial evaluator for extended lambda calculus (Q1264617) (← links)
• Computations in APS (Q1311970) (← links)
• Equational programming in \(\lambda\)-calculus via SL-systems. Part 1 (Q1350516) (← links)
• Sequentiality, monadic second-order logic and tree automata. (Q1854333) (← links)
• Context-sensitive rewriting strategies (Q1854569) (← links)
• Evaluation strategies for functional logic programming (Q2456576) (← links)
• Evaluation strategies for functional logic programming (Q2841220) (← links)
• Reduction strategies for declarative programming (Q2841228) (← links)
• Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
• (Q3821636) (← links)
• Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
• Transforming strongly sequential rewrite systems with constructors for efficient parallel execution (Q5055735) (← links)
• Classes of equational programs that compile into efficient machine code (Q5055738) (← links)
• On interreduction of semi-complete term rewriting systems (Q5941203) (← links)
• Minimal relative normalization in orthogonal expression reduction systems (Q6567775) (← links)