Power Search
Low Price Guarantee
We Take School POs
Comparative Metric Semantics of Programming Languages: Nondeterminism and Recursion 1998 Edition
Contributor(s): Breughel, Franck Van (Author)

View larger image

 ISBN: 0817639276     ISBN-13: 9780817639273
Publisher: Birkhauser
OUR PRICE: $104.49  

Binding Type: Hardcover - See All Available Formats & Editions
Published: December 1997
Qty:

Annotation: This is a book in theoretical computer science that explores the semantics of programming languages with topological methods. Aimed at research workers and advanced graduate students in computer science, the book presents an important contribution to the theory of programming languages ami the semantics that underlie their construction.

Click for more in this series: Progress in Theoretical Computer Science
Additional Information
BISAC Categories:
- Computers | Programming Languages - General
- Computers | Programming - Algorithms
- Computers | Data Processing
Dewey: 004.015
LCCN: 97037052
Series: Progress in Theoretical Computer Science
Physical Information: 0.85" H x 6.38" W x 9.53" L (1.23 lbs) 220 pages
Features: Illustrated, Index
 
Descriptions, Reviews, Etc.
Publisher Description:
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.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!