Results 201 to 210 of about 11,766 (228)
, 1994 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fundamenta Informaticae, 1996
This is an essay where the author expresses his views on applied denotational semantics. In the author's opinion, whether a software system has or does not have a sufficiently abstract denotational semantics should be regarded as a pragmatic attribute of the system rather than merely as a mathematical attribute of its description.
openaire +3 more sources
This is an essay where the author expresses his views on applied denotational semantics. In the author's opinion, whether a software system has or does not have a sufficiently abstract denotational semantics should be regarded as a pragmatic attribute of the system rather than merely as a mathematical attribute of its description.
openaire +3 more sources
Proceedings Third IEEE International Workshop on Source Code Analysis and Manipulation, 2004
We show that CPP, the preprocessor of the C language, can be seen as a programming language in which directives are statements, parametrized macros are functions, files are procedures, directories are modules, and command lines are programs. The semantics of CPP can therefore be described using traditional techniques.
openaire +1 more source
We show that CPP, the preprocessor of the C language, can be seen as a programming language in which directives are statements, parametrized macros are functions, files are procedures, directories are modules, and command lines are programs. The semantics of CPP can therefore be described using traditional techniques.
openaire +1 more source
A denotational semantics of $LC2$
Archive for Mathematical Logic, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Continuous Denotational Semantics
1991The development of a programming logic in the scope of classical first -order logic is connected with making the formal notions, used to describe program properties, internal. This can be ensured by defining the definability of these notions in the logic in question.
Tamás Gergely, László Úry
openaire +1 more source
Denotational semantics of concurrency
Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82, 1982A general framework for the denotational treatment of concurrency is introduced. The key idea is the notion of process which is element of a domain obtained as solution of a domain equation in the style as considered previously by Plotkin. We use tools from metric topology as advocated by Nivat to solve this equation, show how operations upon processes
J. W. de Bakker, J. I. Zucker
openaire +1 more source