Algebraic approaches program semantics par manes ernest (13 résultats)

Etat : good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Paperback. Etat : New.

Etat : New. In English.

Etat : New.

Etat : New. pp. 372.

Paperback. Etat : Brand New. 366 pages. 9.25x6.10x1.10 inches. In Stock.

Hardcover. 351 p. Good condition. The pages are clean and without markings. Slight signs of storage and use. Retired library copy with corresponding markings. Joint slightly loose. Otherwise, a neat copy. 9780387963242 Sprache: Englisch Gewicht in Gramm: 1000.

hardcover. Etat : Good. Good. Dust Jacket NOT present. CD WILL BE MISSING. . SHIPS FROM MULTIPLE LOCATIONS. book.

Etat : gut. 1986. Algebraic Approaches to Program Semantics (Monographs in Computer Science) In englischer Sprache. pages.

Etat : new. Questo è un articolo print on demand.

Etat : New. Print on Demand 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.

Etat : New. PRINT ON DEMAND pp. 372.

Taschenbuch. Etat : 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.…