Computer Science Ser.: Denotational Semantics : The Scott-Strachey Approach to Programming Language Theory by Joseph E. Stoy (1981, Trade Paperback) online kaufen

Über dieses Produkt

Product Identifiers

PublisherMIT Press

ISBN-100262690764

ISBN-139780262690768

eBay Product ID (ePID)89502

Product Key Features

Number of Pages414 Pages

LanguageEnglish

Publication NameDenotational Semantics : the Scott-Strachey Approach to Programming Language Theory

SubjectProgramming Languages / General, Computer Science

Publication Year1981

TypeTextbook

Subject AreaComputers

AuthorJoseph E. Stoy

SeriesComputer Science Ser.

FormatTrade Paperback

Dimensions

Item Height1 in

Item Weight20.8 Oz

Item Length9.1 in

Item Width6.1 in

Additional Product Features

Intended AudienceScholarly & Professional

Dewey Edition19

Grade FromCollege Graduate Student

Dewey Decimal005.13

Synopsis"First book-length exposition of the denotational (or 'mathematical' or 'functional') approach to the formal semantics of programming languages (in contrast to 'operational' and 'axiomatic' approaches). Treats various kinds of languages, beginning with the pure-lambda-calculus and progressing through languages with states, commands, jumps, and assignments. This somewhat discursive account is a valuable compilation of results not otherwise available in a single source."-- American Mathematical Monthly, "First book-length exposition of the denotational (or mathematical' or functional') approach to the formal semantics of programming languages (in contrast to operational' and axiomatic' approaches). Treats various kinds of languages, beginning with the pure-lambda-calculus and progressing through languages with states, commands, jumps, and assignments. This somewhat discursive account is a valuable compilation of results not otherwise available in a single source."--American Mathematical Monthly, First book-length exposition of the denotational (or mathematical' or functional') approach to the formal semantics of programming languages (in contrast to operational' and axiomatic' approaches). Treats various kinds of languages, beginning with the pure-lambda-calculus and progressing through languages with states, commands, jumps, and assignments. This somewhat discursive account is a valuable compilation of results not otherwise available in a single source.--American Mathematical Monthly