Results 231 to 240 of about 228,658 (258)
Some of the next articles are maybe not open access.
1990
Publisher Summary This chapter focuses on denotational semantics, which is a framework for the formal description of programming language semantics. The main idea of denotational semantics is that each phrase of the language described is given a denotation, which is a mathematical object that represents the contribution of the phrase to the meaning of
openaire +2 more sources
Publisher Summary This chapter focuses on denotational semantics, which is a framework for the formal description of programming language semantics. The main idea of denotational semantics is that each phrase of the language described is given a denotation, which is a mathematical object that represents the contribution of the phrase to the meaning of
openaire +2 more sources
A Denotational Semantics of RONDO
1998In this chapter, a formal description of RONDO will be presented. It is based on an extension of the denotational semantics of an object-oriented language with state, O’Small, proposed by Hense [47]. O’Small is a Smalltalk-like objectoriented extension of the imperative language Small [38].
openaire +2 more sources
A Practical Introduction to Denotational Semantics
, 1987From the Publisher: Numerous exercises in Pascal encourage the student to write and test definitions in this introduction to denotational semantics and its applications to programming languages.
L. Allison
semanticscholar +1 more source
Denotational semantics of a calculator
Proceedings of the 1993 ACM conference on Computer science - CSC '93, 1993Denotational semantics1,2,3,4 provides a formal method of precisely and concisely specifying languages, programming languages as well as other kinds of software such as editors and file systems. But those attributes that make denotational descriptions so effective also lead programmers and software designers to reject the method as too complex.
openaire +2 more sources
An Introduction to Denotational Semantics
1986To specify a programming language we must specify its syntax and semantics. The syntax of a programming language specifies which strings of symbols constitute valid programs. A formal description of the syntax typically involves a precise specification of the alphabet of allowable symbols and a finite set of rules delineating how symbols may be grouped
Michael A. Arbib, Ernest G. Manes
openaire +2 more sources
Denotational semantics for RTPA
Canadian Conference on Electrical and Computer Engineering, 2005., 2006Real-time process algebra (RTPA) is designed to deal with a rich set of fundamental real-time processes such as timing, interrupt, concurrency, and event/time-driven. Some of the RTPA processes cannot be described adequately in conventional denotational semantics paradigms. This paper develops a new framework for modeling time and processes in order to
Yingxu Wang, Xinming Tan
openaire +2 more sources
Theoretical and Practical Approaches to the Denotational Semantics for MDESL based on UTP
Formal Aspects of Computing, 2020Feng Sheng+4 more
semanticscholar +1 more source
Denotational semantics for JSD
Proceedings of Joint 4th International Computer Science Conference and 4th Asia Pacific Software Engineering Conference, 2002This paper discusses the use of denotational semantics in formalizing the notations of structured methods. Using the Jackson System Development (JSD) method as an example, the techniques of denotational semantics are applied to the JSD notations to give them a formal semantics based on lambda calculus and communicating sequential processes (CSP). A JSD
openaire +2 more sources
A denotational semantics ofLC2
Archive for Mathematical Logic, 1996The aim of this paper is to extend the classical sequent calculusLC to the second order. This task is realized by a semantical approach mixing the correlation spaces semantics ofLC on the one hand, and the analogy with the interpretation of systemF in coherent spaces on the other hand.
openaire +4 more sources
Definable Denotational Semantics
1991In this chapter we show how an appropriate first-order language can be built up to describe the properties of rP σ 1 -programs. Here we also use the logical tools introduced in Chapter 13, and the method of the development of the required dynamic logics is similar to that used in the previous chapter.
László Úry, Tamás Gergely
openaire +2 more sources