Skip to main content
SpringerLink
Log in
Book cover

Functional Programming, Glasgow 1992 pp 258–268Cite as

Formulating Haskell

  • Conference paper

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

Abstract

The functional programming language Haskell is examined from the point of view of proving programs correct. Particular features explored include the data type definition facilities, classes, the behaviour of patterns and guards and the monad approach to IO in the Glasgow Haskell compiler.

This is a preview of subscription content, 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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Paul Hudak and Joseph H. Fasel. A gentle introduction to Haskell. ACM SIGPLAN Notices, 27 (5), 1992.

    Google Scholar 

  2. Paul Hudak, Simon Peyton Jones, and Philip Wadler (Editors). Report on the Programming Language Haskell, version 1.2. ACM SIGPLAN Notices, 27 (5), 1992.

    Google Scholar 

  3. Lawrence C. Paulson. Logic and Computation — Interactive proof with Cambridge LCF. Cambridge University Press, 1987.

    Google Scholar 

  4. Simon L. Peyton Jones and Philip Wadler. Imperative functional programming. In Twentieth Annual Symposium on Principles of Programming Languages (POPL). ACM, 1993.

    Google Scholar 

  5. Andrew M. Pitts. A co-induction principle for recursively defined domains. Preprint - Computer Laboratory, University of Cambridge, 1992.

    Google Scholar 

  6. Simon J. Thompson. A logic for Miranda. Formal Aspects of Computing, 1, 1989.

    Google Scholar 

  7. Simon J. Thompson. Interactive functional programs: a method and a formal semantics. In David A. Turner, editor, Research Topics in Functional Programming. Addison Wesley, 1990.

    Google Scholar 

  8. Philip Wadler. The essence of functional programming. In Nineteenth Annual Symposium on Principles of Programming Languages (POPL). ACM, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK

    Simon Thompson

Authors
  1. Simon Thompson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, The University, G12 8QQ, Glasgow, Scotland

    John Launchbury MA (Oxon), MSc, PhD  & Patrick Sansom BSc (Hons)  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Thompson, S. (1993). Formulating Haskell. 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_23

Download citation

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

  • 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

Search

Navigation