Higher-Order Attribute Semantics of Flat Declarative Languages
Pavel Grigorenko ; Enn Tyugu
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
A technique is described that provides a convenient instrument for implementation of semantics of simple declarative languages called flat languages. Semantics of a specification is defined in the paper as a set of programs derivable for solvable goals. We introduce higher-order attribute models that include more control information than conventional attribute models and explain the algorithm for dynamic evaluation of attributes on these models. A visual tool CoCoViLa is briefly described as an instrument for implementing attribute semantics of flat languages.
Publié le : 2012-01-26
Classification:  Higher-order attribute models; flat languages; attribute semantics of declarative languages; synthesis of programs; domain specific languages
@article{cai83,
     author = {Pavel Grigorenko and Enn Tyugu},
     title = {Higher-Order Attribute Semantics of Flat Declarative Languages},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai83}
}
Pavel Grigorenko; Enn Tyugu. Higher-Order Attribute Semantics of Flat Declarative Languages. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai83/