圖書標籤: 程序設計語言 計算機 計算機科學 形式語義 Programming CS 語義 計算機軟件和理論
发表于2024-11-26
Formal Semantics of Programming Languages pdf epub mobi txt 電子書 下載 2024
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.
比較深奧,前幾章講Operational Semantics和Denotational Semantics的有些意思。不如TAPL提高快。
評分比較深奧,前幾章講Operational Semantics和Denotational Semantics的有些意思。不如TAPL提高快。
評分比較深奧,前幾章講Operational Semantics和Denotational Semantics的有些意思。不如TAPL提高快。
評分比較深奧,前幾章講Operational Semantics和Denotational Semantics的有些意思。不如TAPL提高快。
評分比較深奧,前幾章講Operational Semantics和Denotational Semantics的有些意思。不如TAPL提高快。
计算机为什么会按人类的指令去执行?这本书用形式化语言(数学)证明了这个可能性。人类的语言如何“翻译”(映射)成机器语言?“翻译”过程如何保证了“语义”不变性。 当我们在计算机上撸代码时,如a=1,我们心里明白,我们是要将1赋值到变量a中,可是计算机并不能理解这句...
評分计算机为什么会按人类的指令去执行?这本书用形式化语言(数学)证明了这个可能性。人类的语言如何“翻译”(映射)成机器语言?“翻译”过程如何保证了“语义”不变性。 当我们在计算机上撸代码时,如a=1,我们心里明白,我们是要将1赋值到变量a中,可是计算机并不能理解这句...
評分计算机为什么会按人类的指令去执行?这本书用形式化语言(数学)证明了这个可能性。人类的语言如何“翻译”(映射)成机器语言?“翻译”过程如何保证了“语义”不变性。 当我们在计算机上撸代码时,如a=1,我们心里明白,我们是要将1赋值到变量a中,可是计算机并不能理解这句...
評分计算机为什么会按人类的指令去执行?这本书用形式化语言(数学)证明了这个可能性。人类的语言如何“翻译”(映射)成机器语言?“翻译”过程如何保证了“语义”不变性。 当我们在计算机上撸代码时,如a=1,我们心里明白,我们是要将1赋值到变量a中,可是计算机并不能理解这句...
評分计算机为什么会按人类的指令去执行?这本书用形式化语言(数学)证明了这个可能性。人类的语言如何“翻译”(映射)成机器语言?“翻译”过程如何保证了“语义”不变性。 当我们在计算机上撸代码时,如a=1,我们心里明白,我们是要将1赋值到变量a中,可是计算机并不能理解这句...
Formal Semantics of Programming Languages pdf epub mobi txt 電子書 下載 2024