Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Виж статуса на поръчката

Свържете се с нас

Algebraic Approaches to Program Semantics

Name: Algebraic Approaches to Program Semantics
Brand: Springer-Verlag New York Inc.
SKU: 9781461293774
Price: 91.61 EUR
Availability: InStock

Автор: Ernest G. Manes, Michael A. Arbib

Език:

Корици: С меки корици

Издател: Springer-Verlag New York Inc.

Наличност: Външен склад

Изпращаме след 5-8 дни

91.61 € 179.17 лв

In the 1930s, mathematical logicians studied the notion of "effective comput ability" using such not...

Информация за книгата

Автор

Ernest G. Manes, Michael A. Arbib

Език

Английски език

Корици

Книга - С меки корици

Издадена

2014

страници

353

EAN

9781461293774

ISBN

1461293774

Enbook ID

02643485

Издател

Springer-Verlag New York Inc.

Теглоt

566

Размери

234 x 158 x 24

Пълно описание

In the 1930s, mathematical logicians studied the notion of "effective comput ability" using such notions as recursive functions, A-calculus, and Turing machines. The 1940s saw the construction of the first electronic computers, and the next 20 years saw the evolution of higher-level programming languages in which programs could be written in a convenient fashion independent (thanks to compilers and interpreters) of the architecture of any specific machine. The development of such languages led in turn to the general analysis of questions of syntax, structuring strings of symbols which could count as legal programs, and semantics, determining the "meaning" of a program, for example, as the function it computes in transforming input data to output results. An important approach to semantics, pioneered by Floyd, Hoare, and Wirth, is called assertion semantics: given a specification of which assertions (preconditions) on input data should guarantee that the results satisfy desired assertions (postconditions) on output data, one seeks a logical proof that the program satisfies its specification. An alternative approach, pioneered by Scott and Strachey, is called denotational semantics: it offers algebraic techniques for characterizing the denotation of (i. e. , the function computed by) a program-the properties of the program can then be checked by direct comparison of the denotation with the specification. This book is an introduction to denotational semantics. More specifically, we introduce the reader to two approaches to denotational semantics: the order semantics of Scott and Strachey and our own partially additive semantics.