Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Algorithmic Program DeBugging
Self-adjusting computation
Subtext: uncovering the simplicity of programming
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Type-safe modular hash-consing
Proceedings of the 2006 workshop on ML
VIVA: A visual language for image processing
Journal of Visual Languages and Computing
Bottom-up meta-modelling: an interactive approach
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
| Hi-index | 0.00 |
Interactive programming is a method for implementing programming languages that supports an interactive, exploratory style of program development and debugging. The basic idea is to reify the steps of a computation into a persistent data structure which can be explored interactively, and which reacts to changes to inputs like a spreadsheet. Reifying the computation associates the computed value with provenance information, which is essential to effective program comprehension and debugging. Making the data structure persistent means that it can evolve incrementally, preserving existing structure where possible, allowing the programmer to apply fixes to a program in the middle of a complex debugging activity without having to restart the program and lose browsing context. Interactive programming lies at the intersection of incremental computation, software visualisation and reactive programming.