Persistent Sequences with Effective Random Access and Support for Infinity

• Autorzy: Grzanek K.

Identyfikatory

DOI

10.2478/jacsm-2014-0005

• Języki publikacji: EN

Abstrakty

EN

Persistent sequences are the core data structure in functional programming style. Their typical implementations usually allow creating infinite streams of objects. Unfortunately, asking for length of an infinite data structure never ends or ends with a run-time error. Similarly, there is no default way to make an effective, O[1] or logarithmic access to an arbitrarily chosen sequence element, even when the nature of the correlation between index value and the sequence element is known. This paper presents a Clojure library that meets these limitations and offers an enhanced version of sequences with a support for effective random access and the ability to ask for an infinite length.

Słowa kluczowe

EN

functional programming; Clojure; persistent collections; infinity; random access

• Wydawca: Społeczna Akademia Nauk w Łodzi
• Czasopismo: Journal of Applied Computer Science Methods
• Rocznik: 2014
• Tom: Vol. 6 No. 1
• Strony: 67--80
• Opis fizyczny: Bibliogr. 9 poz.

Twórcy

autor

Grzanek K.

• IT Institute, University of Social Sciences, Łódź, Poland

Bibliografia

• 1. Halloway S., 2009, Programming Clojure, ISBN: 978-1-93435-633-3, The Pragmatic Bookshelf
• 2. Emerick Ch., Carper B., Grand Ch., 2012, Clojure Programming, O'Reilly Media Inc., ISBN: 978-1-449-39470-7
• 3. Bird R., Wadler P., Introduction to Functional Programming, 1988, Prentice Hall International (UK) Ltd
• 4. Doets K., van Eijck J., The Haskell Road to Logic, Math and Programming, 2004, College Publications, ISBN-10: 0954300696, ISBN-13: 978-0954300692
• 5. Lipovaca M., Learn You a Haskell for Great Good, 2011, ISBN: 978-1-59327-283-8
• 6. Haskell Wikibook, 2014, http://en.wikibooks.org/wiki/Haskell
• 7. Meijer E., Fokkinga M.M., Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire, 1991, Springer Verlag
• 8. Awodey S., Category Theory, Second Edition, 2010, Oxford University Press
• 9. Lehmer D.H., Teaching combinatorial tricks to a computer, 1960, Proc. Sympos. Appl. Math. Combinatorial Analysis, Amer. Math. Soc. 10: pp. 179–193