Pages that link to "Item:Q4700443"

The following pages link to An approach to declarative programming based on a rewriting logic (Q4700443):

Displaying 48 items.

• Constraint logic programming with a relational machine (Q511023) (← links)
• Database query languages and functional logic programming (Q867491) (← links)
• A new generic scheme for functional logic programming with constraints (Q880985) (← links)
• Programming with narrowing: a tutorial (Q968524) (← links)
• A rewriting approach to satisfiability procedures. (Q1401930) (← links)
• Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
• Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
• Evaluation strategies for functional logic programming (Q2456576) (← links)
• Rewriting of imperative programs into logical equations (Q2486260) (← links)
• Reduction strategies for declarative programming (Q2841228) (← links)
• Declarative programming: a logical view (Q2841254) (← links)
• Improving the efficiency of non-deterministic computations (Q2841287) (← links)
• A declarative debugging system for lazy functional logic programs (Q2841290) (← links)
• Comparing Meseguer's rewriting logic with the logic CRWL (Q2841300) (← links)
• Failure and equality in functional logic programming (Q2844060) (← links)
• A safe relational calculus for functional logic deductive databases (Q2844062) (← links)
• Semantic determinism and functional logic program properties (Q2864514) (← links)
• Lazy context cloning for non-deterministic graph rewriting (Q2867896) (← links)
• Extra variables can be eliminated from functional logic programs (Q2867956) (← links)
• Equivalence of two formal semantics for functional logic programs (Q2867964) (← links)
• A framework for interpreting traces of functional logic computations (Q2873790) (← links)
• Implementing dynamic-cut in \(\mathcal{T}OY\) (Q2873795) (← links)
• Transforming Functional Logic Programs into Monadic Functional Programs (Q3003513) (← links)
• An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry (Q3003516) (← links)
• On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← 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)
• Defining Datalog in Rewriting Logic (Q3558298) (← links)
• A Fully Abstract Semantics for Constructor Systems (Q3636832) (← links)
• (Q4222980) (← links)
• Composing programs in a rewriting logic for declarative programming (Q4452602) (← links)
• Default rules for Curry (Q4593082) (← links)
• Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
• Purely functional lazy nondeterministic programming (Q4918241) (← links)
• (Q5013811) (← links)
• (Q5020992) (← links)
• From Logic to Functional Logic Programs (Q5038460) (← links)
• Logic based structure rewriting systems (Q5096292) (← links)
• Constraint functional logic programming over finite domains (Q5309079) (← links)
• Theoretical Aspects of Computing – ICTAC 2005 (Q5395090) (← links)
• Functional Logic Programming in Maude (Q5403075) (← 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)
• Denotation by Transformation (Q5504595) (← links)
• A liberal type system for functional logic programs (Q5740645) (← links)
• A declarative framework for object-oriented programming with genetic inheritance (Q5958620) (← links)