How to Make Destructive Updates Less Destructive (1991)

Cached

Download Links

by Martin Odersky
Venue:IN PROC. 18TH ACM SYMP. ON PRINCIPLES OF PROGRAMMING LANGUAGES
Citations:14 - 1 self

Documents Related by Co-Citation

43 The Aggregate Update Problem in Functional Programming Systems. Pages 300–313 of – P Hudak, A Bloss - 1985
71 Single-threaded polymorphic lambda calculus – J C Guzman, P Hudak - 1990
8 Static Analysis for Safe Destructive Updates (Extended Abstract) – Natarajan Shankar - 2001
31 Update analysis and the efficient implementation of functional aggregates – A Bloss - 1989
32 Shallow Binding in Lisp 1.5 – Henry G. Baker - 1978
14 Set Constraints for Destructive Array Update Optimization – Mitchell Wand, William D. Clinger - 1999
19 Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates – A. V. S. Sastry, William D. CLinger, Zena Ariola - 1993
134 Linear Types Can Change the World! – Philip Wadler - 1990
14 An efficiency comparison of some representations of purely functional arrays – Annika Aasa, Sören Holmström, Christina Nilsson - 1988
1312 Monads for functional programming – Philip Wadler - 1995
456 Comprehending Monads – Philip Wadler - 1992
16 Path Analysis and the Optimization of Non-strict Functional Languages – A Bloss - 1989
15 Endre Tarjan. Amortized computational complexity – Robert - 1985
4 Optimization of very high level languages --- ii. deducing relationships of inclusion and membership – J T Schwartz - 1975
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
56 Detecting global variables in denotational specifications. ACM transactions on programming languages and systems – D A Schmidt - 1985
22 Deques with heap order – H Gajewska, R E Tarjan - 1986
35 Efficient Applicative Data Types – E W Myers - 1984
67 A Semantic Model of Reference Counting and its Abstraction – Paul Hudak - 1986