MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Incremental Algorithms on Lists (1991) [2 citations — 1 self]

by Johan Jeuring
Proceedings SION Computing Science in the Netherlands
Add To MetaCart

Abstract:

Incremental computations can improve the performance of interactive programs such as spreadsheet programs, program development environments, text editors, etc. Incremental algorithms describe how to compute a required value depending on the input, after the input has been edited. By considering the possible different edit actions on the data type lists, the basic data type used in spreadsheet programs and text editors, we define incremental algorithms on lists. Some theory for the construction of incremental algorithms is developed, and we give an incremental algorithm for a more involved example: formatting a text. CR categories and descriptors: D11 [Software]: Programming Techniques --- Applicative Programming, D43 [Software]: Programming Languages --- Language constructs, I22 [Artificial Intelligence]: Automatic Programming --- Program transformation. General terms: algorithm, design, theory. Additional keywords and phrases: Bird-Meertens calculus for program construction, incremen...

Citations

1122 Introduction to Functional Programming – Bird, Wadler - 1988
195 An introduction to the theory of lists – Bird - 1987
130 Data structures for on-line updating of minimum spanning trees – Frederickson - 1983
100 Data structures and program transformation – Malcolm - 1990
86 An Overview of Miranda – Turner - 1986
81 Dynamic Huffman coding – Knuth - 1985
80 Incremental context-dependent analysis for language-based editors. Trans – Reps, Teitelbaum, et al. - 1983
49 Linear algorithm for data compression via string matching – Rodeh, Pratt, et al. - 1981
38 Breaking paragraphs into lines – Knuth, Plass - 1981
26 Programming with invariants – Paige - 1986
24 Inc: A language for incremental computations – Yellin, Strom - 1991
22 Applications of a strategy for designing divide-and-conquer algorithms – Smith - 1987
16 Interactive functional programs: a method and a formal semantics – Thompson - 1987
14 Algorithmics---towards programming as a mathematical activity – Meertens - 1986
11 Transformational programming and the paragraph problem – Bird - 1986
11 Algorithms from theorems – Jeuring - 1990
8 Views: An Open-Architecture User-Interface System – Pemberton - 1990
6 On the line breaking problem in text formatting – Achugbue - 1981
6 Deriving algorithms on binary labelled trees – Jeuring - 1989
5 Incremental string matching – Meyer - 1985
2 Memories of ADJ – Goguen - 1989
1 specification exercises – Small - 1990
1 Using underspecification in the derivation of some optimal partition algorithms – Fokkinga - 1990
1 Categories, relations and dynamic programming. submitted for publication – Moor - 1991