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
Book ChapterDOI
The Mjo :.KC# /lner environment: direct interaction with abstractions
Görel Hedin,Boris Magnusson +1 more
TL;DR: This paper presents the user interface to programs and their execution in the Mjolner Programming Environment to present the programming language abstractions, such as classes and procedures, as individual windows which the user can interact with directly.
Patent
Machine vision methods for determining characteristics of three-dimensional objects
TL;DR: In this paper, a method for determining spatial characteristics of a selected object in an image that has pixel values representing heights of corresponding portions thereof is characterized by the steps of finding one or more heights of portions of the object, determining a volume of the objects at and above (or below) a selected height by summing a count representing a cross-sectional area of objects at that height with a count of volumes of objects above that height, and outputting the volume so determined.
Proceedings ArticleDOI
Frame-Based Editing: Combining the Best of Blocks and Text Programming
TL;DR: This paper presents the design and implementation of a novel way to edit programs: frame-based editing, which retains the easy navigation and clearer display of textual code to support manipulation of complex programs, but fuses this with some of the structured editing capabilities that block programming has shown to be viable.
Journal Article
Freeway incident management
TL;DR: In this article, the authors present a synthesis of the procedures and processes that highway agencies use to respond to traffic congestion caused by incidents on freeways, such as stalled vehicles or accidents that reduce the capacity of the freeway below the level of demand.
Dissertation
Optimizing incremental view maintenance expressions in relational databases
TL;DR: This thesis presents a repertoire of maintenance-specific optimizations, especially in the presence of key constraints and foreign key references, using the RHODES database query optimizer that supports change propagation and view maintenance for relational queries.
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.