Algebraic Approaches to Program Semantics (Monographs in Computer Science)
8 Angebote vergleichen

Lieferung aus: Vereinigte Staaten von Amerika, Free shipping.
Von Händler/Antiquariat, GlassFrogBooks [64674448], Hawthorne, CA, U.S.A.
A+ Customer service! Satisfaction Guaranteed! Book is in Used-Good condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain limited notes and highlighting.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 24 hours, Real shipping costs can differ.
Von Händler/Antiquariat, HPB-Dallas.
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. Hardcover, Edition: 1986, Label: Springer, Springer, Product group: Book, Published: 1986-09-10, Studio: Springer, Sales rank: 1128933.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 6-10 business days, Real shipping costs can differ.
Von Händler/Antiquariat, RushLtd.
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. Hardcover, Edition: 1986, Label: Springer, Springer, Product group: Book, Published: 1986-09-10, Studio: Springer, Sales rank: 1128933.

Lieferung aus: Vereinigte Staaten von Amerika, Shipping costs to: USA.
Von Händler/Antiquariat, Blomsbooks.
Springer, 1986-09-10. Hardcover. Good. Nice conditioned good binding tight minor cover wear spotless but for name on first page only.

Lieferung aus: Vereinigte Staaten von Amerika, In Stock.
artificial intelligence,computer science,computers,computers and technology,education and reference,human vision and language systems,languages and tools,logic,math,mathematics, Algebraic Approaches to Program Semantics, 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,.

Lieferung aus: Vereinigte Staaten von Amerika, Free shipping.
Von Händler/Antiquariat, glenthebookseller [52274160], Montgomery, IL, U.S.A.
0387963243 Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.

Lieferung aus: Vereinigte Staaten von Amerika, Shipping costs to: USA.
Von Händler/Antiquariat, Ergodebooks.
Springer, 1986-09-10. Hardcover. Good.

Lieferung aus: Vereinigte Staaten von Amerika, plus shipping, Shipping area: DOM.
Von Händler/Antiquariat, Blomsbooks, MT, Anaconda, [RE:4].
Hardcover, 1986 ed.