Skip to main content

The nofib Benchmark Suite of Haskell Programs

  • Conference paper
Functional Programming, Glasgow 1992

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

This position paper describes the need for, make-up of, and “rules of the game” for a benchmark suite of Haskell programs. (It does not include results from running the suite.) Those of us working on the Glasgow Haskell compiler hope this suite will encourage sound, quantitative assessment of lazy functional programming systems. This version of this paper reflects the state of play at the initial pre-release of the suite.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. L. Augustsson and T. Johnsson The Chalmers Lazy-ML compiler. Computer Journal, 32 (2): 127–141, April 1989.

    Article  Google Scholar 

  2. Adrienne Bloss, P. Hudak, and J. Young. An optimising compiler for a modern functional language. Computer Journal, 32 (2): 152–161, April 1989.

    Article  Google Scholar 

  3. Thomas M. Conte and Wen-mei W. Hwu. A brief survey of benchmark usage in the architecture community. Computer Architecture News, 19 (4): 37–44, June 1991.

    Article  Google Scholar 

  4. Richard P. Gabriel and Larry M. Masinter. Performance of Lisp systems. In Conference Record of the 1982 ACM Symposium on LISP and Functional Programming, pages 123–142, Pittsburgh, PA, August 15–18 1982.

    Google Scholar 

  5. Brent Hailpern, Tien Huynh, and Gyorgy Révész. Comparing two functional programming systems. IEEE Transactions on Software Engineering, 15 (5): 532–542, May 1989.

    Article  Google Scholar 

  6. Pieter H. Hartel. Performance of lazy combinator graph reduction. Software—Practice and Experience, 21 (3): 299–329, March 1991.

    Article  Google Scholar 

  7. John L. Hennessy and David A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1990.

    Google Scholar 

  8. Lynn Pointer, editor. Perfect report 2. CSRD Report 964, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, March 1990.

    Google Scholar 

  9. Jaswinder Pal Singh, Wolf-Dietrich Weber, and Anoop Gupta. SPLASH: Stanford parallel applications for shared-memory. Computer Architecture News, 20 (1): 5–44, March 1992.

    Article  Google Scholar 

  10. S. C. Wray and J. Fairbairn. Non-strict languages—programming and implementation. Computer Journal, 32 (2): 142–151, April 1989.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Partain, W. (1993). The nofib Benchmark Suite of Haskell Programs. In: Launchbury, J., Sansom, P. (eds) Functional Programming, Glasgow 1992. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3215-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3215-8_17

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19820-8

  • Online ISBN: 978-1-4471-3215-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics