File: recursive.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 (30 lines) | stat: -rw-r--r-- 717 bytes parent folder | download | duplicates (2)
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
module Recursive
  use int.Int
  use seq.Seq
  use mach.java.lang.IndexOutOfBoundsException
  use mach.java.lang.Integer
  use mach.java.util.List 

  type t
  
  let rec count_true_rec (l : list bool) (i : integer) : integer
    requires { length l < Integer.max_integer }
    ensures { i <= length l -> result <= length l - i }
    requires { 0 <= i }
    variant { length l  - i }
  =
    let e_x = i+1 in 
    try
      if i >= size l then 0
      else if get l i then 1 + count_true_rec l e_x
      else count_true_rec l e_x
    with
     IndexOutOfBoundsException.E -> absurd
    end
    
  let count_true (l : list bool) : integer
    requires { length l < Integer.max_integer }
  =
    count_true_rec l 0

end