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
Proceedings ArticleDOI
Does the computer system make a difference in the effectiveness of the introductory service course
TL;DR: An experiment measuring the effect of different hardware configurations on the teaching of an introductory programming course is described, and the results of the evaluation are presented.
Proceedings ArticleDOI
Technological advances in software engineering
TL;DR: The concrete syntax and runtime support description defines how the specilic objects use the common facilities such as memor3t or output wiudc>ws, what upd0tir~g is needed when objects are created or deleted and what kind of consistency rules or access control applies to the objects in the target system.
PECCit: An Omniscient Debugger for Web Development
TL;DR: PECCit’s features and debugging capabilities are demonstrated and contrasted with standard debugging techniques and real-world problems provided by users of two Content Management Systems: WordPress and Drupal are evaluated.
Proceedings ArticleDOI
Requirements for a Practical Software Engineering Environment
TL;DR: This paper, primarily, presents the facilities that satisfy the user requirements for a modern software engineering environment under development on VS at Wang Laboratories, Inc.
DissertationDOI
Envision: Reinventing the Integrated Development Environment
TL;DR: This dissertation challenges the established practice of reading and writing programs as text by building a development environment in which programming interfaces are not tightly bound to the content of source files, and introduces novel interaction techniques for structured and visual code.
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.