Hope (programming language)
| Paradigm | functional |
|---|---|
| Designed by | Rod Burstall D. B. MacQueen D. T. Sannella |
| Developer | University of Edinburgh |
| First appeared | 1980 |
| Dialects | |
| Hope+ | |
| Influenced by | |
| NPL | |
Hope is a small programming language based on functional programming developed in the 1970s at the University of Edinburgh.[1][2] It predates Miranda and Haskell and is contemporaneous with ML, also developed at the University. Hope was derived from NPL,[3] a simple functional language developed by Rod Burstall and John Darlington in their work on program transformation.[4] NPL and Hope are notable for being the first languages with call-by-pattern evaluation and algebraic data types.[5]
Hope was named for Sir Thomas Hope (c. 1681–1771), a Scottish agriculture reformer, after whom Hope Park Square in Edinburgh, the location of the artificial intelligence department at the time of the development of Hope, was also named.
The first implementation of Hope used strict evaluation, but there have since been lazy evaluation versions and strict versions with lazy constructors. A successor language Hope+, developed jointly between Imperial College and International Computers Limited, added annotations to dictate either strict or lazy evaluation.[6]
Language details
[edit]A factorial program in Hope is:
dec fact : num -> num; --- fact 0 <= 1; --- fact n <= n*fact(n-1);
Changing the order of clauses does not change the meaning of the program, because Hope's pattern matching always favors more specific patterns over less specific ones. Explicit declarations of data types in Hope are required; there is no option to use a type inference algorithm in Hope.
Hope provides two built-in data structures: tuples and lists.[7]
Implementations
[edit]Roger Bailey's Hope tutorial in the August 1985 issue of Byte references an interpreter for IBM PC DOS 2.0.[7] British Telecom embarked on a project with Imperial College London to implement a version of Hope. The first release was coded by Thanos Vassilakis in 1986. Further releases were coded by Mark Tasng of British Telecom.
References
[edit]- ^ Burstall, R. M.; MacQueen, D. B.; Sannella, D. T. (1980). Hope: An Experimental Applicative Language (PDF). Stanford University, Stanford, California, United States. p. 136–143.
{{cite book}}: CS1 maint: location missing publisher (link) - ^ Bailey, Roger (1 April 1990). Functional Programming with Hope. Ellis Horwood Series in Computers and Their Applications. Ellis Horwood Ltd.
- ^ Burstall, R. M. (1977). Design considerations for a functional programming language (invited paper). Proceedings Infotech State of the Art Conference "The Software Revolution". Copenhagen. pp. 45–57.
- ^ Burstall, R. M.; Darlington, J. (1977). "A transformation system for developing recursive programs". Journal of the Association for Computing Machinery. 24 (1): 44–67.
- ^ Hudak, Paul; Hughes, John; Peyton Jones, Simon; Wadler, Philip (2007-06-09). A history of Haskell: being lazy with class. ACM. pp. 12–1. doi:10.1145/1238844.1238856. ISBN 9781595937667. S2CID 52847907.
- ^ Kewley, John; Glynn, Kevin (1989). "Evaluation Annotations for Hope+". In Davis, Kei; Hughes, R. J. M. (eds.). Functional Programming: Proceedings of the 1989 Glasgow Workshop, Workshops in Computing. London, United Kingdom: Springer-Verlag (published 1990). pp. 329–337.
- ^ a b Bailey, Roger (August 1985). "A Hope Tutorial". Byte. Vol. 10, no. 8. p. 235–258. Retrieved 13 January 2025.
