Relating logic programs and attribute grammars

DOI10.1016/0743-1066(85)90015-9zbMath0586.68073OpenAlexW2072500626MaRDI QIDQ3711779

Jan Małuszyński, Pierre Deransart

Publication date: 1985

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00076163/file/RR-0393.pdf

zbMATH Keywords

proof treesdecorated treesfunctional attribute grammarsimple definite-clause program

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of software (68N99)

Related Items (14)

Evolution of rule-based programs ⋮ AID: an alternative implementation of DCGs ⋮ Attribute and unification grammar: A review and analysis of formalisms ⋮ Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming ⋮ Can we transform logic programs into attribute grammars ? ⋮ Inductive assertion method for logic pograms ⋮ A relaxed condition for avoiding the occur-check ⋮ On the complexity of regular-grammars with integer attributes ⋮ On attribute grammars without attribute synthesis ⋮ Computational and attribute models of formal languages ⋮ An operational formal definition of PROLOG: A specification method and its application ⋮ Proof methods of declarative properties of definite programs ⋮ Context-free hypergraph grammars have the same term-generating power as attribute grammars ⋮ The accepting power of unary string logic programs

This page was built for publication: Relating logic programs and attribute grammars