| 000 | 03936nam a2200493 i 4500 | ||
|---|---|---|---|
| 001 | 6276826 | ||
| 003 | IEEE | ||
| 005 | 20220712204743.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 151223s1993 maua ob 001 eng d | ||
| 010 | _z 92036718 (print) | ||
| 020 | _a0262231697 | ||
| 020 |
_a9780262291453 _qelectronic |
||
| 020 |
_z9780262731034 _qprint |
||
| 035 | _a(CaBNVSL)mat06276826 | ||
| 035 | _a(IDAMS)0b000064818c1f32 | ||
| 040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
| 050 | 4 |
_aQA76.7 _b.W555 1993eb |
|
| 082 | 0 | 0 |
_a005.13/1 _220 |
| 100 | 1 |
_aWinskel, G., _q(Glynn) _eauthor. _923505 |
|
| 245 | 1 | 4 |
_aThe formal semantics of programming languages : _ban introduction / _cGlynn Winskel. |
| 264 | 1 |
_aCambridge, Massachusetts : _bMIT Press, _cc1993. |
|
| 264 | 2 |
_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[1993] |
|
| 300 |
_a1 PDF (xviii, 361 pages) : _billustrations. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aelectronic _2isbdmedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 490 | 1 | _aFoundations of computing | |
| 504 | _aIncludes bibliographical references (p. [353]-356) and index. | ||
| 506 | 1 | _aRestricted to subscribers or individual electronic text purchasers. | |
| 520 | _aThe 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. | ||
| 530 | _aAlso available in print. | ||
| 538 | _aMode of access: World Wide Web | ||
| 588 | _aDescription based on PDF viewed 12/23/2015. | ||
| 650 | 0 |
_aProgramming languages (Electronic computers) _xSemantics. _93865 |
|
| 655 | 0 |
_aElectronic books. _93294 |
|
| 710 | 2 |
_aIEEE Xplore (Online Service), _edistributor. _923506 |
|
| 710 | 2 |
_aMIT Press, _epublisher. _923507 |
|
| 776 | 0 | 8 |
_iPrint version _z9780262731034 |
| 830 | 0 |
_aFoundations of computing _922604 |
|
| 856 | 4 | 2 |
_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6276826 |
| 942 | _cEBK | ||
| 999 |
_c73223 _d73223 |
||