Skip to main content

Abstract

Fortran, C and C++ are three dominant languages used in scientific computation. As a result, derivatives of these languages prevail in parallel computation as well. However, imperative languages do not naturally support parallelism. Functional languages, such as EPL, SISAL, Haskell, etc. [11] isolate the programmer from the complexities of parallel programming. These languages expose implicit parallelism through data independence. Functional programs that run correctly on a single processor are guaranteed to run correctly on any multiprocessor regardless of architecture.

Supported in part by NSF Grant CCR-9101280.

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

Access this chapter

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. John Backus: “Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs”, Comm of ACM, Aug 1978

    Google Scholar 

  2. Henry G. Baker: “A ‘Linear Logic’ Quicksort”, ACM Sigplan Notices, Feb 1994

    Google Scholar 

  3. Adrienne Bloss: “Update Analysis and the Efficient Implementation of Functional Aggregates”, FPCA, ACM 1989

    Google Scholar 

  4. George Becker, Neil V. Murray: “Efficient execution of Programs with Static Semantics”, ACM Sigplan Notices April 1995

    Google Scholar 

  5. David Cann: “Retire Fortran? A debate rekindled”, Comm of ACM, Aug 1992

    Google Scholar 

  6. J. Darlington et al.: “Parallel Programming Using Skeleton Functions”, PARLE’93, LNCS 694

    Google Scholar 

  7. Peter Landin: “The Next 700 Programming Languages”, Comm. of ACM March 1966

    Google Scholar 

  8. E. Nöcker, J. Smetsers, M. v. Eekelen, M. Plasmeijer: “Concurrent Clean”, PARLE’90, LNCS 505

    Google Scholar 

  9. Bjarne Steensgaard: “Sparse Functional Stores for Imperative Programs”, Workshop on Intermediate Representations, POPL’95

    Google Scholar 

  10. Mario Südholt: “Data Distribution Algebras - A Formal Basis for Programming Using Skeletons”, Programming Concepts, Methods and Calculi IFIP, North-Holland, June 1994

    Google Scholar 

  11. B. Szymanski: Parallel Functional Languages and Compilers,ACM Press, 1991

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

Becker, G., Murray, N.V., Stearns, R.E. (1996). Refined Single-Threading for Parallel Functional Programming. In: Szymanski, B.K., Sinharoy, B. (eds) Languages, Compilers and Run-Time Systems for Scalable Computers. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2315-4_31

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2315-4_31

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5979-1

  • Online ISBN: 978-1-4615-2315-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics