scientific article; zbMATH DE number 870438
From MaRDI portal
Publication:4875865
zbMATH Open0849.68010MaRDI QIDQ4875865FDOQ4875865
Authors: Pierre Deransart, Jan Maluszyński 
Publication date: 25 April 1996
Title of this publication is not available (Why is that?)
Recommendations
- Relating logic programs and attribute grammars
- scientific article; zbMATH DE number 4180778
- scientific article; zbMATH DE number 4195156
- Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
- Can we transform logic programs into attribute grammars ?
Cited In (23)
- Declarative debugging in constraint logic programming
- Case injected genetic algorithms for traveling salesman problems
- On completeness of logic programs
- A backward slicing algorithm for Prolog
- Evolution of rule-based programs
- Modules and specifications
- Relating logic programs and attribute grammars
- Efficient reconfigurable embedded parsers
- Constrained dependencies
- Synchronized regular expressions
- Proof methods of declarative properties of definite programs
- On Correctness and Completeness of an n Queens Program
- S-semantics -- an example
- Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
- Computation of non-ground disjunctive well-founded semantics with constraint logic programming
- Logic + control: on program construction and verification
- A relaxed condition for avoiding the occur-check
- On the complexity of regular-grammars with integer attributes
- Set constraints with intersection
- Proving completeness of logic programs with the cut
- Title not available (Why is that?)
- Termination of constraint logic programs
- Model-based computing: Developing flexible machine control software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875865)
