Formal Semantics of Programming Languages

Valutazione media 3,73
( su 22 valutazioni fornite da Goodreads )
 
9780262731034: Formal Semantics of Programming Languages

The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs.Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

About the Author:

Glynn Winskel is Professor of Computer Science at the University of Aarhus, Denmark.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

I migliori risultati di ricerca su AbeBooks

1.

Glynn Winskel
Editore: The MIT Press (1993)
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi Paperback Quantità: 1
Da
Irish Booksellers
(Rumford, ME, U.S.A.)
Valutazione libreria
[?]

Descrizione libro The MIT Press, 1993. Paperback. Condizione libro: New. book. Codice libro della libreria M0262731037

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 38,70
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

2.

Glynn Winskel
Editore: The MIT Press (1993)
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi Paperback Quantità: 1
Da
Ergodebooks
(RICHMOND, TX, U.S.A.)
Valutazione libreria
[?]

Descrizione libro The MIT Press, 1993. Paperback. Condizione libro: New. Codice libro della libreria DADAX0262731037

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 45,46
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 7,57
In U.S.A.
Destinazione, tempi e costi

3.

Winskel, Glynn
Editore: MIT Press (1993)
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi Quantità: 12
Da
Books2Anywhere
(Fairford, GLOS, Regno Unito)
Valutazione libreria
[?]

Descrizione libro MIT Press, 1993. PAP. Condizione libro: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Codice libro della libreria WM-9780262731034

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 45,29
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 10,23
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

4.

Winskel, Glynn
Editore: The MIT Press (1993)
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi Paperback Quantità: 2
Da
Murray Media
(North Miami Beach, FL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro The MIT Press, 1993. Paperback. Condizione libro: New. Never used!. Codice libro della libreria P110262731037

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 55,18
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 1,68
In U.S.A.
Destinazione, tempi e costi

5.

Glynn Winskel
Editore: MIT Press Ltd, United States (1993)
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi Paperback Quantità: 10
Da
The Book Depository
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro MIT Press Ltd, United States, 1993. Paperback. Condizione libro: New. Language: English . Brand New Book. The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel s incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs.Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs. Codice libro della libreria AAH9780262731034

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 60,87
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

6.

Winskel, Glynn
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi Quantità: > 20
Da
Paperbackshop-US
(Wood Dale, IL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro 1993. PAP. Condizione libro: New. New Book. Shipped from US within 10 to 14 business days. Established seller since 2000. Codice libro della libreria TM-9780262731034

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 58,04
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,36
In U.S.A.
Destinazione, tempi e costi

7.

Glynn Winskel
Editore: MIT Press
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi Quantità: > 20
Da
INDOO
(Avenel, NJ, U.S.A.)
Valutazione libreria
[?]

Descrizione libro MIT Press. Condizione libro: New. Brand New. Codice libro della libreria 0262731037

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 59,06
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 2,95
In U.S.A.
Destinazione, tempi e costi

8.

Glynn Winskel
Editore: MIT Press Ltd, United States (1993)
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi Paperback Quantità: 10
Da
The Book Depository US
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro MIT Press Ltd, United States, 1993. Paperback. Condizione libro: New. Language: English . Brand New Book. The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel s incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs.Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs. Codice libro della libreria AAH9780262731034

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 62,35
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

9.

Glynn Winskel
Editore: The MIT Press 1993-04-01, Cambridge, Massachusetts (1993)
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi paperback Quantità: 5
Da
Blackwell's
(Oxford, OX, Regno Unito)
Valutazione libreria
[?]

Descrizione libro The MIT Press 1993-04-01, Cambridge, Massachusetts, 1993. paperback. Condizione libro: New. Codice libro della libreria 9780262731034

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 58,50
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 6,82
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

10.

Glynn Winskel
Editore: MIT Press
ISBN 10: 0262731037 ISBN 13: 9780262731034
Nuovi Paperback Quantità: 16
Da
THE SAINT BOOKSTORE
(Southport, Regno Unito)
Valutazione libreria
[?]

Descrizione libro MIT Press. Paperback. Condizione libro: New. New copy - Usually dispatched within 2 working days. Codice libro della libreria B9780262731034

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 61,72
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 7,89
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

Vedi altre copie di questo libro

Vedi tutti i risultati per questo libro