001412304 000__ 03756cam\a2200445Ka\4500
001412304 001__ 1412304
001412304 003__ MaCbMITP
001412304 005__ 20240325105204.0
001412304 006__ m\\\\\o\\d\\\\\\\\
001412304 007__ cr\cn\nnnunnun
001412304 008__ 130208s1993\\\\maua\\\\ob\\\\001\0\eng\d
001412304 020__ $$a0262291452$$q(electronic bk.)
001412304 020__ $$a9780262291453$$q(electronic bk.)
001412304 020__ $$z0262231697
001412304 020__ $$z9780262231695
001412304 035__ $$a(OCoLC)827009813$$z(OCoLC)1058133306
001412304 035__ $$a(OCoLC-P)827009813
001412304 040__ $$aOCoLC-P$$beng$$epn$$cOCoLC-P
001412304 050_4 $$aQA76.7$$b.W555 1993eb
001412304 08204 $$a005.13/1$$222
001412304 1001_ $$aWinskel, G.$$q(Glynn)
001412304 24514 $$aThe formal semantics of programming languages :$$ban introduction /$$cGlynn Winskel.
001412304 260__ $$aCambridge, Mass. :$$bMIT Press,$$c©1993.
001412304 300__ $$a1 online resource (xviii, 361 pages) :$$billustrations.
001412304 336__ $$atext$$btxt$$2rdacontent
001412304 337__ $$acomputer$$bc$$2rdamedia
001412304 338__ $$aonline resource$$bcr$$2rdacarrier
001412304 4901_ $$aFoundations of computing
001412304 506__ $$aAccess limited to authorized users.
001412304 5203_ $$a"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 concurrency. 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."
001412304 588__ $$aOCLC-licensed vendor bibliographic record.
001412304 650_0 $$aProgramming languages (Electronic computers)$$xSemantics.
001412304 653__ $$aCOMPUTER SCIENCE/Programming Languages
001412304 655_0 $$aElectronic books
001412304 852__ $$bebk
001412304 85640 $$3MIT Press$$uhttps://univsouthin.idm.oclc.org/login?url=https://doi.org/10.7551/mitpress/3054.001.0001?locatt=mode:legacy$$zOnline Access through The MIT Press Direct
001412304 85642 $$3OCLC metadata license agreement$$uhttp://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf
001412304 909CO $$ooai:library.usi.edu:1412304$$pGLOBAL_SET
001412304 980__ $$aBIB
001412304 980__ $$aEBOOK
001412304 982__ $$aEbook
001412304 983__ $$aOnline