An approach to declarative programming based on a rewriting logic
From MaRDI portal
Recommendations
- Composing programs in a rewriting logic for declarative programming
- Declarative programming: a logical view
- Publication:4890715
- scientific article; zbMATH DE number 785048
- A rewrite approach for constraint logic programming
- Basic rewriting via logic programming, with an application to the reachability problem
- scientific article; zbMATH DE number 10085
- Rewriting of imperative programs into logical equations
- Logic based structure rewriting systems
- Declarative Logic Programming: Theory, Systems, and Applications
Cited in
(53)- A rewriting approach to satisfiability procedures.
- Rewriting logic: Roadmap and bibliography
- Operational semantics for declarative multi-paradigm languages
- Evaluation strategies for functional logic programming
- Rewriting of imperative programs into logical equations
- Reduction strategies for declarative programming
- Declarative programming: a logical view
- Improving the efficiency of non-deterministic computations
- A declarative debugging system for lazy functional logic programs
- Comparing Meseguer's rewriting logic with the logic CRWL
- Failure and equality in functional logic programming
- A safe relational calculus for functional logic deductive databases
- Semantic determinism and functional logic program properties
- Lazy context cloning for non-deterministic graph rewriting
- Extra variables can be eliminated from functional logic programs
- Equivalence of two formal semantics for functional logic programs
- A framework for interpreting traces of functional logic computations
- Implementing dynamic-cut in \(\mathcal{T}OY\)
- Declarative compilation for constraint logic programming
- Transforming functional logic programs into monadic functional programs
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
- scientific article; zbMATH DE number 4191131 (Why is no real title available?)
- Compiling a functional logic language: \textit{The Fair Scheme}
- A Relation Algebraic Semantics for a Lazy Functional Logic Language
- On a Tighter Integration of Functional and Logic Programming
- Defining Datalog in Rewriting Logic
- A Fully Abstract Semantics for Constructor Systems
- Deduction and Declarative Programming
- scientific article; zbMATH DE number 408794 (Why is no real title available?)
- scientific article; zbMATH DE number 1231655 (Why is no real title available?)
- Composing programs in a rewriting logic for declarative programming
- Default rules for Curry
- Functional Logic Programming: From Theory to Curry
- Purely functional lazy nondeterministic programming
- Needed computations shortcutting needed steps
- scientific article; zbMATH DE number 7455733 (Why is no real title available?)
- From Logic to Functional Logic Programs
- Logic based structure rewriting systems
- Constraint logic programming with a relational machine
- Declarative Programming with Function Patterns
- Constraint functional logic programming over finite domains
- Theoretical Aspects of Computing – ICTAC 2005
- Functional logic programming in Maude
- Singular and plural functions for functional logic programming
- Rewriting and narrowing for constructor systems with call-time choice semantics
- Rewriting and Call-Time Choice: The HO Case
- Denotation by Transformation
- A liberal type system for functional logic programs
- A declarative framework for object-oriented programming with genetic inheritance
- Database query languages and functional logic programming
- A new generic scheme for functional logic programming with constraints
- Programming with narrowing: a tutorial
This page was built for publication: An approach to declarative programming based on a rewriting logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700443)
