It has often been remarked that surprisingly few parts of the algorithms which define an operating system require the use of unsafe, low-level language features {1}. Nevertheless, the lack of safety inherent in these ...
详细信息
作者：
Denll, N.J.IBM
T. J. Watson Research Center Yorktown HeightsNY10598 United States
This paper describes a medium being developed for abstraction and expression of program structure. The medium is to be used to represent programs during the design process;it forms the basis for their implementation. ...
详细信息
It is becoming increasingly evident that human programmers are not capable of efficiently producing reliable programs if they must be concerned initially with every detail of the final program. The approach described ...
详细信息
TRAIL is a block-structured language and programming system for the development of programming support systems and translators for problem-oriented languages on minicomputers. The programming system includes an interp...
详细信息
We postulate a general computing model and investigate the design and implementation of systems in the postulated environment. The model is drawn from our interpretation of the writings of John von Newmann 1 and other...
ISBN:
(纸本)9781450374903
We postulate a general computing model and investigate the design and implementation of systems in the postulated environment. The model is drawn from our interpretation of the writings of John von Newmann 1 and others. Its central concept is an abstraction of the capability of all digital computers to modify cells contents that represent addresses of other cells. We discuss three formulations of the model; namely, a “programminglanguage” formulation using vectors, pointers, and move operators, an “emulator” formulation extending the first formulation to include control structure and execution semantics, and a “mathematical” formulation. The proposed model is specifically intended for the interactive design and implementation of software (and also hardware) computer systems. The completeness and the hierarchial nature of the descriptions based on the model allow those descriptions to serve as simulation models and documentation for the complete system being described or for any well-defined part of the system.
language definitions by abstract interpreters are appropriate to the design and development of a language. Axiomatic definitions are more appropriate to proving program properties and verification of compilers. The pr...
详细信息
The proceedings contain 21 papers. The topics discussed include: implementation and applications of Scott's logic for computable functions;an algebraic description of programs with assertions, verification and sim...
The proceedings contain 21 papers. The topics discussed include: implementation and applications of Scott's logic for computable functions;an algebraic description of programs with assertions, verification and simulation;derivation of axiomatic definitions of programminglanguages from algorithmic definitions;inductive methods for proving properties of programs;program correctness methods and language definition;recursive definitions of partial functions and their computations;the correctness of numerical algorithms;decision problems in computational models;and translating recursion schemes into program schemes.
A framework is developed for the operational characterization of the semantics of computational formalisms such as programminglanguages, digital computers and automata. Operational semantics is contrasted with input-...
详细信息
At the present time there is considerable interest in the general question of T'automating programming;" there are a number of people actively doing research concerned with various aspects of the question and...
详细信息
The basis for this paper is a logic designed by Dana Scott [1] in 196 9 for formalizing arguments about computable functions of higher type. This logic uses typed combinators, and we give a more or less direct transla...
详细信息
暂无评论