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
An architecture for intelligent assistance in software development
Gail E. Kaiser,Peter H. Feiler +1 more
TL;DR: An architecture for a software engineering environment that behaves as an intelligent assistant, whereby the environment performs software development activities through controlled automation through forward and backward chaining interpretation of the rule set.
Proceedings ArticleDOI
Invited research overview: end-user programming
TL;DR: This paper gives a brief summary of some current and past research in the area of End- user programming, focusing on making end-user programming more reliable, using "End-User Software Engineering."
Proceedings ArticleDOI
Optimal-time incremental semantic analysis for syntax-directed editors
TL;DR: An algorithm is presented that identifies attributes in AFFECTED and computes their new values and the algorithm is time-optimal, its cost is proportional to the size of AFFectED.
Proceedings ArticleDOI
TouchDevelop: programming cloud-connected mobile devices via touchscreen
TL;DR: In this vision, the state of the program is automatically distributed between mobile clients and the cloud, with automatic synchronization of data and execution between clients and cloud, liberating the programmer from worrying (or even having to know about) the details.
Journal ArticleDOI
An execution-backtracking approach to debugging
TL;DR: Spyder, a system for selective checkpointing of computational sequences, offers a structured view of dynamic events, similar to lexical scope rules' effect on static visibility, and speeds backtracking to statements before loops and provides what-if capabilities.
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.