Add higher-order-functions and some other goodies

  * The reads clause now needs to be self framing.

  * The requires clause now needs to be framed by the reads clause.

  * There are one-shot lambdas, with a single arrow, but they will probably be
    removed.

  * There is a {:heapQuantifier} attribute to quantifiers, but they will
    probably be removed.

  * Add smart handling of type variables

  * Add < and > for datatype & type parameter

1 files changed, 29 insertions, 0 deletions

diff --git a/Test/hofs/Apply.dfy b/Test/hofs/Apply.dfy
new file mode 100644
index 00000000..bdd102c2
--- /dev/null
+++ b/Test/hofs/Apply.dfy
@@ -0,0 +1,29 @@
+// RUN: %dafny /compile:0 /print:"%t.print" /dprint:"%t.dprint" "%s" > "%t"
+// RUN: %diff "%s.expect" "%t"
+
+
+method Apply(x : int) returns (i : int)
+  ensures i == x;
+{
+  i := (x => x)(x);
+}
+
+function method Const<A,B>(a : A) : B -> A {
+  b => a
+}
+
+method Test(m : map<int, int -> int -> int>)
+{
+  assume forall i :: i in m;
+  assume forall i, x :: m[i].requires(x);
+  assume forall i, x, y :: m[i](x).requires(y);
+  assume m[1](2)(3) > 5;
+  assert ((m[1])(2))(3) > 4;
+}
+
+method Main() {
+  assert forall x : int, y : int :: Const(x)(y) == (Const(x))(y);
+  assert (a => b => a) == (u : int) => (v : int) => u;
+  assert Const == (u : int) => (v : int) => u;
+}
+