Skip to main content
SpringerLink
Log in

Arrays in HASKELL

  • Chapter
Arrays, Functional Languages, and Parallel Systems

  • 65 Accesses

Abstract

This paper describes from an user point of view the array notation of the HASKELL lazy functional language. The array notation was defined in such a way as to enable an efficient implementation of indexing and updating while keeping a high level expression power. We show by means of examples how to create and use arrays.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Kamal Abdali and David S. Wise. Experiments with quadtree representation of matrices. Technical Report 241, Indiana University, Computer Science Department, February 1988.

    Google Scholar 

  2. Steven Anderson and Paul Hudak. Compilation of Haskell array comprehensions for scientific computing. Proceedings of the ACM SIGPLAN′90 Conference on Programming Language Design and Implementation, Sigplan Notices, pages 137–149, June 1990.

    Google Scholar 

  3. R. Bird and P. Wadler. Introduction to Functional Programming. Prentice-Hall, 1988.

    Google Scholar 

  4. P. Hudak and P. Wadler (editors). Report on the programming language Haskell, a non-strict purely functional language (Version 1.0). Technical Report YALEU/DCS/RR777, Yale University, Department of Computer Science, April 1990.

    Google Scholar 

  5. Research Software Limited. Miranda System Manual, Version 2. 1989.

    Google Scholar 

  6. D.A. Turner. Miranda - a non strict functional language with polymorphic types. In P. Jouannaud, editor, Conference on Functional Programming and Computer Architecture, Lecture Notes in Computer Science #201, pages 1–16, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, Succ “A”, Montréal, Québec, Canada, H3C 3J7

    Guy Lapalme

Authors
  1. Guy Lapalme
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Vermont, USA

    Lenore M. R. Mullin

  2. Queen’s University, USA

    Michael Jenkins

  3. University of Montreal, Canada

    Gaétan Hains

  4. Snake Island Research, USA

    Robert Bernecky

  5. McGill University, Canada

    Guang Gao

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Lapalme, G. (1991). Arrays in HASKELL. In: Mullin, L.M.R., Jenkins, M., Hains, G., Bernecky, R., Gao, G. (eds) Arrays, Functional Languages, and Parallel Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4002-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-4002-1_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6789-5

  • Online ISBN: 978-1-4615-4002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation