Algebraic Approaches to Program Semantics
Manes, Ernest G.; Arbib, Michael A.
ISBN 10: 1461293774 ISBN 13: 9781461293774
Verlag: Springer-Verlag New York Inc., 2014
Neu
Softcover
Verkäufer
Kennys Bookstore, Olney, MD, USA
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 9. Oktober 2009
Dieser Artikel ist nicht mehr verfügbar.
Beschreibung
Beschreibung:
Series: Monographs in Computer Science. Num Pages: 366 pages, biography. BIC Classification: UM; UYA; UYQ. Category: (P) Professional & Vocational. Dimension: 158 x 234 x 24. Weight in Grams: 566. . 2014. Paperback. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9781461293774
Inhaltsangabe:
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.
Reseña del editor: 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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Bibliografische Details
Titel: Algebraic Approaches to Program Semantics
Verlag: Springer-Verlag New York Inc.
Erscheinungsdatum: 2014
Einband: Softcover
Zustand: New
Beste Suchergebnisse beim ZVAB
Foto des Verkäufers
Algebraic Approaches to Program Semantics
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. Artikel-Nr. 4191889
Anzahl: Mehr als 20 verfügbar
Algebraic Approaches to Program Semantics
Anbieter: preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Algebraic Approaches to Program Semantics | Michael A. Arbib (u. a.) | Taschenbuch | xiii | Englisch | 2014 | Springer New York | EAN 9781461293774 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Artikel-Nr. 105332075
Anzahl: 5 verfügbar
Beispielbild für diese ISBN
Algebraic Approaches to Program Semantics (Monographs in Computer Science)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9781461293774_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Algebraic Approaches to Program Semantics
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9781461293774
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algebraic Approaches to Program Semantics (Monographs in Computer Science)
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Brand New. 366 pages. 9.25x6.10x1.10 inches. In Stock. Artikel-Nr. x-1461293774
Anzahl: 2 verfügbar