File: array_poly.mlw

package info (click to toggle)
why3 1.8.2-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 45,028 kB
  • sloc: xml: 185,443; ml: 111,224; ansic: 3,998; sh: 2,578; makefile: 2,568; java: 865; python: 720; javascript: 290; lisp: 205; pascal: 173
file content (35 lines) | stat: -rw-r--r-- 446 bytes parent folder | download | duplicates (5) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
 

module A

  use int.Int
  use array.Array

  let f1 (a:array int) : int
  = a[0]

  let f2 (a:array int) : unit
    requires { a.length >= 2 }
    ensures { a[0] <> a[1] }
  = a[0] <- 42

end

module B

  use int.Int
  use array.Array
  clone array.Sorted with 
    type elt=int,
    predicate le=(<=)
  

  let f1 (a:array int) : unit
    ensures { sorted a }
  = ()


  let f2 (a:array int) : array int
    ensures { sorted result }
  = a

end