Hope (programming language): Difference between revisions

Revision as of 18:03, 5 February 2014

Revision as of 11:08, 18 February 2014

Line 1:

'''Hope''' is a small [[functional (programming)|functional]] [[programming language]] developed in the 1970s at [[University of Edinburgh|Edinburgh University]].<ref name="BMS">Burstall R.M, MacQueen D.B, Sannella D.T. (1980) ''Hope: An Experimental Applicative Language''. Conference Record of the 1980 LISP Conference, Stanford University, pp. 136-143.</ref> <ref name="design"> R.M. Burstall. Design considerations for a functional programming language. Invited paper, Proc. Infotech State of the Art Conf. “The Software Revolution”, Copenhagen, 45–57 (1977)</ref> It predates [[Miranda programming language|Miranda]] and [[Haskell (programming language)|Haskell]] and is contemporaneous with [[ML (programming language)|ML]] (also developed at Edinburgh). Hope Itwas isderived notablefrom forNPL, being<ref thename="design"/> firsta simple functional language withdeveloped call-by-pattern evaluation{{CitationBurstall needed|reason=Prologand appearedDarlington in 1972their work on program transformation.<ref> R.M. Burstall and hasJ. Darlington. A transformation system for developing recursive programs. Journal of the Association for Computing Machinery, 24(1):44–67 (1977)</ref> NPL was, in turn, derived from Kleene Recursion Equations. NPL and Hope are notable for being the first languages with call-by-pattern evaluation withand itsalgebraic 'rules'data types.{{Citation needed|date=February 2014}} SNOBOL is even older, and its 'patterns' may qualify as a hybrid between call-by-pattern and regular expression matching.|date=April 2013}} and [[algebraic data type]]s.{{Citation needed|date=April 2013}} Hope is an important language in the development of functional programming.

The name may have been derived from ''Hope Park Square'' in Edinburgh, at one time the ___location of the Department of Artificial Intelligence.