Journal ArticleDOI
The Cornell program synthesizer: a syntax-directed programming environment
Tim Teitelbaum,Thomas Reps +1 more
TLDR
The Cornell Program Synthesizer demands a structural perspective at all stages of program development and its separate features are unified by a common foundation: a grammar for the programming language.Abstract:
Programs are not text; they are hierarchical compositions of computational structures and should be edited, executed, and debugged in an environment that consistently acknowledges and reinforces this viewpoint. The Cornell Program Synthesizer demands a structural perspective at all stages of program development. Its separate features are unified by a common foundation: a grammar for the programming language. Its full-screen derivation-tree editor and syntax-directed diagnostic interpreter combine to make the Synthesizer a powerful and responsive interactive programming tool.read more
Citations
More filters
Journal ArticleDOI
Language design for program manipulation
TL;DR: The design of procedural and object-oriented programming languages is considered with respect to how easily programs written in those languages can be formally manipulated, and three main areas of language design are identified as being of concern.
Journal ArticleDOI
A program development tool
TL;DR: This paper describes how a number of tools are combined into a single system to aid in the reading, writing, and running of programs to form a synergistic union.
Journal ArticleDOI
Holophrasted displays in an interactive environment
TL;DR: It is shown how an environment with knowledge of the entities it manipulates can automatically produce cathode-ray tube displays with more helpful contextual information for the user than a traditional display of contiguous lines from a source file.
Proceedings ArticleDOI
A greedy concurrent approach to incremental code generation
Ray Ford,Duangkaew Sawamiphakdi +1 more
TL;DR: The PSEP System represents a novel approach to incremental compilation for block structured languages as a highly concurrent system of two processes: an editor and a code generator, utilizing semantic information about the concurrent system to guarantee the consistency of the shared objects.
Journal ArticleDOI
Inverse‐engineering a simple real‐time program
E. J. Younger,Martin Ward +1 more
TL;DR: A significant advance in reverse-engineering is presented by modelling real-time programs with interrupts in the wide spectrum language, WSL, by using formal program transformations to derive timing constraints and to ‘inverse-engineer’ a formal specification of the program.
References
More filters
Proceedings ArticleDOI
Closest-point problems
Michael Ian Shamos,Dan Hoey +1 more
TL;DR: The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.
Journal ArticleDOI
Algorithms for Reporting and Counting Geometric Intersections
TL;DR: Algorithms that count the number of pairwise intersections among a set of N objects in the plane and algorithms that report all such intersections are given.
Proceedings ArticleDOI
A research center for augmenting human intellect
TL;DR: In this article, a multisponsor research center at Stanford Research Institute in man-computer interaction is described, where the authors describe a multiscale multi-modal system.
Proceedings ArticleDOI
Geometric intersection problems
Michael Ian Shamos,Dan Hoey +1 more
TL;DR: An O(N log N) algorithm is given to determine whether any two intersect and use it to detect whether two simple plane polygons intersect and to show that the Simplex method is not optimal.
Journal ArticleDOI
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
TL;DR: This paper investigates the problem of reporting all intersecting pairs in a set of n rectilinearly oriented rectangles in the plane and describes an algorithm that solves this problem in worst case time proportional to n lg n + k, where k is the number of interesecting pairs found.