Fully Abstract Semantics for Practical Languages

语义定义的编程语言，这是完全 摘要是构建数学框架所必需的 用于程序优化。 特别是， 需要捕获实用语言中的程序短语。 今天， 指称语言规范通常使人工 具有不可区分行为的程序短语之间的区别。 一种基于对误差值的现实处理的新方法， 模型中的误差传播在该项目中被利用。 顺序 函数在逐点排序下形成普通的Scott域， 错误元素的存在，并可以表示为决策 树 这有助于隐式地描述错误是如何传播的。 这种方法将用于定义实用语言，例如 FORTRAN、Pascal、C、ML和Scheme。

Semantic definitions for programming languages which are fully abstract are needed in the construction of a mathematical framework for program optimization. In particular, the observable behavior of program phrases in practical languages needs to be captured. Today, denotational language specifications often make artificial distinctions between program phrases with indistinguishable behavior. A new approach based upon a realistic treatment of error values and error propagation in models is utilized in this project. Sequential functions form an ordinary Scott-domain under pointwise ordering in the presence of error elements and can be represented as decision trees. This helps to implicitly describe how errors are propagated. This approach will be used to define practical languages such as FORTRAN, Pascal, C, ML, and Scheme.