Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
From MaRDI portal
Publication:2640347
DOI10.1016/0890-5401(88)90002-8zbMath0719.68038OpenAlexW2033188125MaRDI QIDQ2640347
Bruno Courcelle, Pierre Deransart
Publication date: 1988
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(88)90002-8
Related Items
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, Can we transform logic programs into attribute grammars ?, Inductive assertion method for logic pograms, Attribute Grammars and Categorical Semantics, Computational and attribute models of formal languages, Proof methods of declarative properties of definite programs, Context-free hypergraph grammars have the same term-generating power as attribute grammars, Attributed tree grammars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple multi-visit attribute grammars
- Correctness proofs of syntax-directed processing descriptions by attributes
- Speeding up circularity tests for attribute grammars
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
- The formal power of one-visit attribute grammars
- Attribute grammars and recursive program schemes. I. II
- Theory of program structures: Schemes, semantics, verification
- On the completeness of the inductive assertion method
- Extended Attribute Grammars
- Relating logic programs and attribute grammars
- Error diagnosis in logic programming an adaptation of E.Y. Shapiro's method
- Attribute Grammars and Mathematical Semantics
- Contributions to the Theory of Logic Programming
- Initial Algebra Semantics and Continuous Algebras
- A New Incompleteness Result for Hoare's System
- IO-macrolanguages and attributed translations
- An order-algebraic definition of knuthian semantics
