Modular bialgebraic semantics and algebraic laws

التفاصيل البيبلوغرافية
العنوان: Modular bialgebraic semantics and algebraic laws
المؤلفون: Ken Madlener, Sjaak Smetsers, Marko van Eekelen
المساهمون: Bois, A. du
المصدر: Programming Languages ISBN: 9783642409219
SBLP
Bois, A. du (ed.), Programming languages : 17th brazilian symposium, sblp 2013, brasília, brazil, september 29-october 4, 2013, proceedings, pp. 46-60
Lecture notes in computer science, 46-60. Berlin : Springer
STARTPAGE=46;ENDPAGE=60;TITLE=Lecture notes in computer science
سنة النشر: 2013
مصطلحات موضوعية: Algebraic laws, Computer science, business.industry, Programming language, Semantics (computer science), Lecture notes in computer science, Modular design, computer.software_genre, Unobservable, Operational semantics, Computer Science::Programming Languages, Digital Security, business, computer
الوصف: The ability to independently describe operational rules is indispensable for a modular description of programming languages. This paper introduces a format for open-ended rules and proves that conservatively adding new rules results in well-behaved translations between the models of the operational semantics. Silent transitions in our operational model are truly unobservable, which enables one to prove the validity of algebraic laws between programs. We also show that algebraic laws are preserved by extensions of the language and that they are substitutive. The work presented in this paper is developed within the framework of bialgebraic semantics.
وصف الملف: application/pdf
ردمك: 978-3-642-40921-9
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11f0e9c51c044ae26f0bb128aea73ad0
https://hdl.handle.net/2066/119899
حقوق: OPEN
رقم الأكسشن: edsair.doi.dedup.....11f0e9c51c044ae26f0bb128aea73ad0
قاعدة البيانات: OpenAIRE