Composing programs in a rewriting logic for declarative programming
From MaRDI portal
Publication:4452602
DOI10.1017/S1471068402001527zbMATH Open1111.68382OpenAlexW2179833932MaRDI QIDQ4452602FDOQ4452602
Author name not available (Why is that?)
Publication date: 1 March 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068402001527
Logic programming (68N17) Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18)
Cited In (8)
- Abstract domains for reordering CLP(RLin) programs
- An approach to declarative programming based on a rewriting logic
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
- Title not available (Why is that?)
- Rewriting of imperative programs into logical equations
- Title not available (Why is that?)
- A declarative framework for object-oriented programming with genetic inheritance
- Title not available (Why is that?)
Recommendations
- An approach to declarative programming based on a rewriting logic π π
- Title not available (Why is that?) π π
- Compositional Specification in Rewriting Logic π π
- Program Development in Computational Logic π π
- A compositional semantics for logic programs π π
- Program Development in Computational Logic π π
- Verification, Model Checking, and Abstract Interpretation π π
- Compilation as Rewriting in Higher Order Logic π π
- Rewriting of imperative programs into logical equations π π
- Title not available (Why is that?) π π
This page was built for publication: Composing programs in a rewriting logic for declarative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452602)