Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 97,27
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 94,47
Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Condizione: New. pp. 372.
EUR 80,86
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 127,17
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 372 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Da: Revaluation Books, Exeter, Regno Unito
EUR 140,67
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 366 pages. 9.25x6.10x1.10 inches. In Stock.
EUR 83,90
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Algebraic Approaches to Program Semantics | Ernest G. Manes (u. a.) | Taschenbuch | Monographs in Computer Science | xiii | Englisch | 2014 | Springer | EAN 9781461293774 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
EUR 100,22
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 75,84
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Lingua: Inglese
Editore: Springer New York, Humana Jan 2014, 2014
ISBN 10: 1461293774 ISBN 13: 9781461293774
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 93,08
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 372 pp. Englisch.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 132,19
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 372.
Lingua: Inglese
Editore: Springer, Springer Jan 2014, 2014
ISBN 10: 1461293774 ISBN 13: 9781461293774
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 93,08
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 372 pp. Englisch.