Pages that link to "Item:Q2456574"

The following pages link to Operational semantics for declarative multi-paradigm languages (Q2456574):

Displaying 18 items.

• Dynamic slicing of lazy functional programs based on redex trails (Q2271904) (← links)
• Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
• Transforming Boolean equalities into constraints (Q2628300) (← links)
• Extra Variables Can Be Eliminated from Functional Logic Programs (Q2867956) (← links)
• Equivalence of Two Formal Semantics for Functional Logic Programs (Q2867964) (← links)
• Reporting Failures in Functional Logic Programs (Q2873788) (← links)
• A Framework for Interpreting Traces of Functional Logic Computations (Q2873790) (← links)
• An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry (Q3003516) (← links)
• Compiling a Functional Logic Language: The Fair Scheme (Q3453653) (← links)
• A Relation Algebraic Semantics for a Lazy Functional Logic Language (Q3498404) (← links)
• On a Tighter Integration of Functional and Logic Programming (Q3498436) (← links)
• Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
• Purely functional lazy nondeterministic programming (Q4918241) (← links)
• Singular and plural functions for functional logic programming (Q5410261) (← links)
• Rewriting and narrowing for constructor systems with call-time choice semantics (Q5410729) (← links)
• Rewriting and Call-Time Choice: The HO Case (Q5458434) (← links)
• Preserving Sharing in the Partial Evaluation of Lazy Functional Programs (Q5504594) (← links)
• From Boolean Equalities to Constraints (Q5743586) (← links)