Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 97,20
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 94,41
Cantidad disponible: 10 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 120,63
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 372.
EUR 80,86
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 126,22
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 139,85
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 366 pages. 9.25x6.10x1.10 inches. In Stock.
EUR 83,90
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: 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
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 75,84
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer New York, Humana Jan 2014, 2014
ISBN 10: 1461293774 ISBN 13: 9781461293774
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 93,08
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 132,19
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 372.
Idioma: Inglés
Publicado por Springer, Springer Jan 2014, 2014
ISBN 10: 1461293774 ISBN 13: 9781461293774
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 93,08
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.