编辑“︁Hope语言”︁（章节）

==语言细节==
[[斐波那契数]]程序用Hope写为：
<syntaxhighlight lang="ocaml">
dec fib : num -> num
--- fib(0) <= 1
--- fib(succ(0)) <= 1
--- fib(succ(succ(n))) <= fib(succ(n)) + fib(n)
</syntaxhighlight>
改变子句的次序不改变程序的含义，因为Hope的[[模式匹配]]，总是偏好更加特殊的模式，胜过不太特殊的模式。在Hope要求显式类型声明；在Hope中没有使用类型推论的选择余地。

Hope后来在列表之外增加了[[元组]]作为内建数据结构<ref name=byte>{{cite magazine
| title = A Hope Tutorial
| author = Roger Bailey
| magazine = [[Byte magazine|BYTE]]
| volume = 10
| issue = 8
| date = August 1985
| url = http://www.doc.gold.ac.uk/~mas01sd/cis229/hope_tut.pdf
| access-date = 1 April 2015
| archive-date = 2011-01-12
| archive-url = https://web.archive.org/web/20110112091643/http://www.doc.gold.ac.uk/~mas01sd/cis229/hope_tut.pdf
}}</ref>。