On the algebraic definition of programming languages Export

@article{citeulike:3404883, abstract = {The algebraic specification of the semantics of programming languages is outlined. Particular emphasis is given to the problem of specifying least-fixed points by first-order conditional equations. To cover this issue, the theory of specifying partial heterogeneous algebras by abstract data types is slightly extended by a more general notion of homomorphism. In this framework the semantics of programming languages can be uniquely specified in a purely algebraic way, using particular models of a hierarchy of abstract types. This approach is demonstrated for a simple procedural programming language. Several increasingly complex versions of iterations are treated and analyzed with respect to their theoretical consequences. Finally, as a complementary algebraic technique, transformational semantics is explained and applied to our examples.}, address = {New York, NY, USA}, author = {Broy, Manfred and Wirsing, Martin and Pepper, Peter}, citeulike-article-id = {3404883}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=9758.10501}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/9758.10501}, doi = {10.1145/9758.10501}, issn = {0164-0925}, journal = {ACM Trans. Program. Lang. Syst.}, keywords = {1987, algebraic, language}, number = {1}, pages = {54--99}, posted-at = {2008-10-15 16:52:04}, priority = {2}, publisher = {ACM}, title = {On the algebraic definition of programming languages}, url = {http://dx.doi.org/10.1145/9758.10501}, volume = {9}, year = {1987} }

TY - JOUR ID - citeulike:3404883 L3 - citeulike-article-id:3404883 N2 - The algebraic specification of the semantics of programming languages is outlined. Particular emphasis is given to the problem of specifying least-fixed points by first-order conditional equations. To cover this issue, the theory of specifying partial heterogeneous algebras by abstract data types is slightly extended by a more general notion of homomorphism. In this framework the semantics of programming languages can be uniquely specified in a purely algebraic way, using particular models of a hierarchy of abstract types. This approach is demonstrated for a simple procedural programming language. Several increasingly complex versions of iterations are treated and analyzed with respect to their theoretical consequences. Finally, as a complementary algebraic technique, transformational semantics is explained and applied to our examples. IS - 1 JF - ACM Trans. Program. Lang. Syst. SN - 0164-0925 AD - New York, NY, USA EP - 99 TI - On the algebraic definition of programming languages PB - ACM VL - 9 SP - 54 KW - 1987 KW - algebraic KW - language AU - Broy, Manfred AU - Wirsing, Martin AU - Pepper, Peter PY - 1987/// UR - http://dx.doi.org/10.1145/9758.10501 ER -