An Oxford survey of order sorted algebra
J Goguen, R Diaconescu - Mathematical Structures in Computer …, 1994 - cambridge.org
This paper surveys several different variants of order sorted algebra (abbreviated OSA),
comparing some of the main approaches (overloaded OSA, universe OSA, unified algebra …
comparing some of the main approaches (overloaded OSA, universe OSA, unified algebra …
Algebraic approaches to nondeterminism—an overview
M Walicki, S Meldal - ACM Computing Surveys (CSUR), 1997 - dl.acm.org
Mathematics never saw much of a reason to deal with something called nondeterminism. It
works with values, functions, sets, and relations. In computing science, however …
works with values, functions, sets, and relations. In computing science, however …
Denotational semantics
PD Mosses - Formal Models and Semantics, 1990 - Elsevier
Publisher Summary This chapter focuses on denotational semantics, which is a framework
for the formal description of programming language semantics. The main idea of …
for the formal description of programming language semantics. The main idea of …
The rewriting logic semantics project
J Meseguer, G Roşu - Theoretical Computer Science, 2007 - Elsevier
Rewriting logic is a flexible and expressive logical framework that unifies algebraic
denotational semantics and structural operational semantics (SOS) in a novel way, avoiding …
denotational semantics and structural operational semantics (SOS) in a novel way, avoiding …
A rewriting logic approach to operational semantics
This paper shows how rewriting logic semantics (RLS) can be used as a computational logic
framework for operational semantic definitions of programming languages. Several …
framework for operational semantic definitions of programming languages. Several …
[HTML][HTML] The rewriting logic semantics project: A progress report
J Meseguer, G Roşu - Information and Computation, 2013 - Elsevier
Rewriting logic is an executable logical framework well suited for the semantic definition of
languages. Any such framework has to be judged by its effectiveness to bridge the existing …
languages. Any such framework has to be judged by its effectiveness to bridge the existing …
A survey of semantic description frameworks for programming languages
Y Zhang, B Xu - ACM Sigplan Notices, 2004 - dl.acm.org
Formal semantic description is significant for design, reasoning and standardization of
programming languages, and it plays an important part in the optimization of the compiler …
programming languages, and it plays an important part in the optimization of the compiler …
Theory and practice of action semantics
PD Mosses - … Symposium on Mathematical Foundations of Computer …, 1996 - Springer
Action Semantics is a framework for the formal description of programming languages. Its
main advantage over other frameworks is pragmatic: action-semantic descriptions (ASDs) …
main advantage over other frameworks is pragmatic: action-semantic descriptions (ASDs) …
Unified algebras and institutions
PD Mosses - DAIMI Report Series, 1989 - tidsskrift.dk
Unified Algebras and Institutions Page 1 ISSN 0105.8517 Unified Algebras and Institutions
Peter D. Mosses DAIMII PB – 274 February 1989 AAP-HUS UN||VEPS|TY | | | COMPUTER …
Peter D. Mosses DAIMII PB – 274 February 1989 AAP-HUS UN||VEPS|TY | | | COMPUTER …
Modular rewriting semantics of programming languages
J Meseguer, C Braga - International Conference on Algebraic …, 2004 - Springer
We present a general method to achieve modularity of semantic definitions of programming
languages specified as rewrite theories. This provides modularity for a language …
languages specified as rewrite theories. This provides modularity for a language …