Fully Abstract Semantics for Practical Languages

实用语言的完全抽象语义

• 批准号: 9122518
• 负责人: Robert Cartwright
• 金额: --
• 依托单位: William Marsh Rice University
• 依托单位国家: 美国
• 项目类别: Continuing grant
• 财政年份: 1992
• 资助国家: 美国
• 起止时间: 1992-07-01 至 1996-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9122518&HistoricalAwards=false
• 关键词: Fully; Abstract; Semantics; Practical; Languages

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.

在构建程序优化的数学框架时需要完全抽象的编程语言的语义定义。 特别是，需要捕获实际语言中程序短语的可观察行为。 如今，指称语言规范经常在具有不可区分行为的程序短语之间进行人为区分。 该项目采用了一种基于模型中误差值和误差传播的实际处理的新方法。 在存在错误元素的情况下，顺序函数在逐点排序下形成普通的斯科特域，并且可以表示为决策树。 这有助于隐式描述错误如何传播。 这种方法将用于定义实用语言，例如 FORTRAN、Pascal、C、ML 和 Scheme。