Computational and attribute models of formal languages
DOI10.1016/0304-3975(90)90200-2zbMath0698.68067OpenAlexW2028838139MaRDI QIDQ912638
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90200-2
logic programmingintuitionistic propositional calculuscomputational modelsattribute grammarssemantics of programming languagesattribute evaluation programsprogram and compiler specificationstructural synthesis of programs
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Artificial intelligence (68T99) Theory of software (68N99)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Simple multi-visit attribute grammars
- Synthesis of a semantic processor from an attribute grammar
- Justification of the structural synthesis of programs
- The programming system PRIZ
- Attribute grammars and recursive program schemes. I. II
- GAG: a practical compiler generator
- Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
- Relating logic programs and attribute grammars
- The intrinsically exponential complexity of the circularity problem for attribute grammars
This page was built for publication: Computational and attribute models of formal languages