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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Paul Hudak and Joseph H. Fasel. A gentle introduction to Haskell. ACM SIGPLAN Notices, 27 (5), 1992.
Paul Hudak, Simon Peyton Jones, and Philip Wadler (Editors). Report on the Programming Language Haskell, version 1.2. ACM SIGPLAN Notices, 27 (5), 1992.
Lawrence C. Paulson. Logic and Computation — Interactive proof with Cambridge LCF. Cambridge University Press, 1987.
Simon L. Peyton Jones and Philip Wadler. Imperative functional programming. In Twentieth Annual Symposium on Principles of Programming Languages (POPL). ACM, 1993.
Andrew M. Pitts. A co-induction principle for recursively defined domains. Preprint - Computer Laboratory, University of Cambridge, 1992.
Simon J. Thompson. A logic for Miranda. Formal Aspects of Computing, 1, 1989.
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.
Philip Wadler. The essence of functional programming. In Nineteenth Annual Symposium on Principles of Programming Languages (POPL). ACM, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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