Efficient applicative data types

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient applicative data types

Full text

Pdf (718 KB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages table of contents

Salt Lake City, Utah, United States

Pages: 66 - 75

Year of Publication: 1984

ISBN:0-89791-125-3

Author

Eugene W. Myers

Department of Computer Science, The University of Arizona, Tucson, Arizona

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGAPL: ACM Special Interest Group on APL Programming Language

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 28, Citation Count: 24

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800017.800517 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Adel'son-Vel'skii, G.M. and Landis, E.M. "An Algorithm for the Organization of Information." Dokl. Akad. Nauk SSSR 146 (1962), 263-266 (Russian). English translation in Soviet Math. Dokl. 3 (1962), 1259-1262.
	2	John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
	3	Manfred Broy , Peter Pepper, Combining Algebraic and Algorithmic Reasoning: An Approach to the Schorr-Waite Algorithm, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.362-381, July 1982 [doi>10.1145/357172.357175]
	4	Dobkin, D.P. and Munro, J.I. "Efficient Uses of the Past." Proc. 21st ACM Symp. on Foundations of Computer Science (1980), 200-206.
	5	Hood, R. and Melville, R. "Real-Time Queue Operations in Pure LISP." Inform. Process. Lett. 13, 2 (1981), 50-54.
	6	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	7	James H. Morris , Eric Schmidt , Philip Wadler, Experience with an applicative string processing language, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.32-46, January 28-30, 1980, Las Vegas, Nevada [doi>10.1145/567446.567450]
	8	Myers, E.W. "An Applicative Random-Access Stack" Inform. Process. Lett. (to appear).
	9	Myers, E.W. "AVL Dags" TR 82-9, Dept. of Computer Science, U. of Arizona, Tucson, AZ (1982).
	10	J. Weizenbaum, Symmetric list processor, Communications of the ACM, v.6 n.9, p.524-536, Sept. 1963 [doi>10.1145/367593.367617]

CITED BY 24

	Roger Hoover , Tim Teitelbaum, Efficient incremental evaluation of aggregate values in attribute grammars, ACM SIGPLAN Notices, v.21 n.7, p.39-50, July 1986
	Christipher W. Fraser , Eugene W. Myers, An editor for revision control, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.2, p.277-295, April 1987
	Tyng-Ruey Chuang , Wen L. Hwang, A probabilistic approach to the problem of automatic selection of data representations, ACM SIGPLAN Notices, v.31 n.6, p.190-200, June 15, 1996
	Chris Okasaki, Purely functional random-access lists, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.86-95, June 26-28, 1995, La Jolla, California, United States
	Herbert Kuchen , Katia Gladitz, Parallel implementation of bags, Proceedings of the conference on Functional programming languages and computer architecture, p.299-307, June 09-11, 1993, Copenhagen, Denmark
	Ralf Hinze, Bootstrapping one-sided flexible arrays, ACM SIGPLAN Notices, v.37 n.9, p.2-13, September 2002
	Adam L. Buchsbaum , Robert E. Tarjan, Confluently persistent deques via data structuaral bootstrapping, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.155-164, January 25-27, 1993, Austin, Texas, United States
	Qingbo Zhu , Windsor W. Hsu, Fossilized index: the linchpin of trustworthy non-alterable electronic records, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, June 14-16, 2005, Baltimore, Maryland
	Tyng-Ruey Chuang, A randomized implementation of multiple functional arrays, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.173-184, July-Sept. 1994
	Nicholas Pippenger, Pure versus impure Lisp, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.2, p.223-238, March 1997
	J R Driscoll , N Sarnak , D D Sleator , R E Tarjan, Making data structures persistent, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.109-121, May 28-30, 1986, Berkeley, California, United States
	Tyng-Ruey Chuang , Benjamin Goldberg, Real-time deques, multihead Turing machines, and purely functional programming, Proceedings of the conference on Functional programming languages and computer architecture, p.289-298, June 09-11, 1993, Copenhagen, Denmark
	J. Plaice , W. W. Wadge, A New Approach to Version Control, IEEE Transactions on Software Engineering, v.19 n.3, p.268-276, March 1993
	Thomas Reps, Scan grammars: parallel attribute evaluation via data-parallelism, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, p.367-376, June 30-July 02, 1993, Velen, Germany
	James R. Driscoll , Daniel D. K. Sleator , Robert E. Tarjan, Fully persistent lists with catenation, Journal of the ACM (JACM), v.41 n.5, p.943-959, Sept. 1994
	Chris Okasaki, Catenable double-ended queues, ACM SIGPLAN Notices, v.32 n.8, p.66-74, Aug. 1997
	R. Farrow , A. G. Stanculescu, A VHDL compiler based on attribute grammar methodology, ACM SIGPLAN Notices, v.24 n.7, p.120-130, July 1989
	James R. Driscoll , Daniel D. K. Sleator , Robert E. Tarjan, Fully persistent lists with catenation, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.89-99, January 28-30, 1991, San Francisco, California, United States
	Neil Sarnak , Robert E. Tarjan, Planar point location using persistent search trees, Communications of the ACM, v.29 n.7, p.669-679, July 1986
	Jan Heering , Paul Klint, Towards monolingual programming environments, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.2, p.183-213, April 1985
	Danny Krizanc , Pat Morin , Michiel Smid, Range mode and range median queries on lists and trees, Nordic Journal of Computing, v.12 n.1, p.1-17, March 2005
	Henry G. Baker, Lively linear Lisp: “look ma, no garbage!”, ACM SIGPLAN Notices, v.27 n.8, p.89-98, Aug. 1992
	Melissa E. O'Neill , F. Warren Burton, A new method for functional arrays, Journal of Functional Programming, v.7 n.5, p.487-513, September 1997
	Guy Blelloch , Hal Burch , Karl Crary , Robert Harper , Gary Miller , Noel Walkington, Persistent triangulations, Journal of Functional Programming, v.11 n.5, p.441-466, September 2001