![Comparative Metric Semantics of Programming Languages [electronic resource] : Nondeterminism and Recursion /](/search/themes/bootstrap3/images/libros.png)
Comparative Metric Semantics of Programming Languages [electronic resource] : Nondeterminism and Recursion /
During the last three decades several different styles of semantics for program ming languages have been developed. This book compares two of them: the operational and the denotational approach. On the basis of several exam ples we show how to define operational and denotational semantic models for programming languages. Furthermore, we introduce a general technique for comparing various semantic models for a given language. We focus on different degrees of nondeterminism in programming lan guages. Nondeterminism arises naturally in concurrent languages. It is also an important concept in specification languages. In the examples discussed, the degree of non determinism ranges from a choice between two alternatives to a choice between a collection of alternatives indexed by a closed interval of the real numbers. The former arises in a language with nondeterministic choices. A real time language with dense choices gives rise to the latter. We also consider the nondeterministic random assignment and parallel composition, both couched in a simple language. Besides non determinism our four example languages contain some form of recursion, a key ingredient of programming languages.
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Boston, MA : Birkhäuser Boston,
1998
|
| Subjects: | Computer science., Computer programming., Programming languages (Electronic computers)., Algorithms., Computer science, Applied mathematics., Engineering mathematics., Computer mathematics., Computer Science., Math Applications in Computer Science., Applications of Mathematics., Programming Languages, Compilers, Interpreters., Programming Techniques., Computational Mathematics and Numerical Analysis., Algorithm Analysis and Problem Complexity., |
| Online Access: | http://dx.doi.org/10.1007/978-1-4612-4160-7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | During the last three decades several different styles of semantics for program ming languages have been developed. This book compares two of them: the operational and the denotational approach. On the basis of several exam ples we show how to define operational and denotational semantic models for programming languages. Furthermore, we introduce a general technique for comparing various semantic models for a given language. We focus on different degrees of nondeterminism in programming lan guages. Nondeterminism arises naturally in concurrent languages. It is also an important concept in specification languages. In the examples discussed, the degree of non determinism ranges from a choice between two alternatives to a choice between a collection of alternatives indexed by a closed interval of the real numbers. The former arises in a language with nondeterministic choices. A real time language with dense choices gives rise to the latter. We also consider the nondeterministic random assignment and parallel composition, both couched in a simple language. Besides non determinism our four example languages contain some form of recursion, a key ingredient of programming languages. |
|---|