Hope (programming language): Difference between revisions

Revision as of 11:51, 11 April 2018

Revision as of 03:24, 18 May 2018

Line 17:

| url = http://www.devili.iki.fi/library/issue/136.en.html

| accessdate = 1 April 2015

}}</ref> It predates [[Miranda programming language|Miranda]] and [[Haskell (programming language)|Haskell]] and is contemporaneous with [[ML (programming language)|ML]], also developed at the University. Hope was derived from [[NPL (programming language)|NPL]],<ref name="design"/> a simple functional language developed by [[Rod Burstall]] and John Darlington in their work on program transformation.<ref> R.M. Burstall and J. 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 [[Stephen Cole Kleene|Kleene recursion equations]]. NPL and Hope are notable for being the first languages with call-by-pattern evaluation and algebraic data types.{{Citation needed|date=February 2014}} (Though [[SNOBOL]] is even older, and its 'patterns' may qualify as a hybrid between call-by-pattern and regular expression matching.){{Citation needed|date=April 2013}} Hope is an important language in the development of functional programming.

Hope was named for [[Sir Thomas Hope, 8th Baronet|Sir Thomas Hope]] (c. 1681–1771), a Scottish agricultural reformer, after whom ''Hope Park Square'' in Edinburgh, the ___location of the Department of Artificial Intelligence at the time of the development of Hope, was also named.