Commit 96addbf6 authored by Guillaume Melquiond's avatar Guillaume Melquiond
Browse files

Reduce amount of "use export" in the standard library.

parent 2015eda9
......@@ -2,6 +2,7 @@
module M
use import int.Int
use import ref.Refint
use import array.Array
......
......@@ -9,6 +9,7 @@
module Roberval
use export int.Int
use export ref.Refint
type outcome = Left | Equal | Right
......@@ -174,4 +175,4 @@ module Puzzle12
end
end
end
\ No newline at end of file
end
......@@ -6,7 +6,10 @@
theory Graph
use export list.List
use import list.Append
use export list.Length
use list.Mem
use export int.Int
use export set.Fset
......
......@@ -6,6 +6,7 @@
module CheckingALargeRoutine
use import int.Int
use import int.Fact
use import ref.Ref
......
......@@ -42,6 +42,7 @@
module Conjugate
use import int.Int
use import ref.Refint
use import array.Array
......@@ -137,4 +138,4 @@ end
B[i] = partc - 1;
}
}
*)
\ No newline at end of file
*)
......@@ -17,7 +17,7 @@
module Spec
use import int.Int
use export int.Int
use export array.Array
use export array.IntArraySorted
......
......@@ -3,11 +3,12 @@
module FactRecursive
use import int.Int
use import int.Fact
let rec fact_rec (x:int) : int
requires { x >= 0 }
variant { x }
let rec fact_rec (x:int) : int
requires { x >= 0 }
variant { x }
ensures { result = fact x }
= if x = 0 then 1 else x * fact_rec (x-1)
......@@ -20,6 +21,7 @@ end
module FactImperative
use import int.Int
use import int.Fact
use import ref.Ref
......
......@@ -240,6 +240,7 @@ end
module FibonacciLogarithmic
use import int.Int
use import int.Fibonacci
use import int.EuclideanDivision
use import Mat22
......
......@@ -7,6 +7,7 @@
module Max
use import int.Int
use import ref.Refint
use import array.Array
......
......@@ -7,6 +7,7 @@
module TwoEqualElements
use import int.Int
use import ref.Refint
use import array.Array
......
......@@ -129,6 +129,7 @@ module M
(** behavior *)
use import list.List
use import list.Append
use import list.Reverse
......@@ -298,6 +299,7 @@ module M2
(** behavior *)
use import list.List
use import list.Append
use import list.Reverse
......
......@@ -8,9 +8,10 @@
module RandomAccessList
use import int.Int
use import option.Option
use import list.List
use import list.Append
use import list.HdTl
use import list.Nth
type tree 'a =
| Leaf 'a
......
......@@ -8,6 +8,7 @@ module InsertionSort
clone relations.TotalPreOrder with type t = elt, predicate rel = le
clone export list.Sorted with type t = elt, predicate le = le
use import list.List
use import list.Permut
let rec insert (x: elt) (l: list elt) : list elt
......
......@@ -33,6 +33,7 @@ end
(* Naive solution, in O(N^3) *)
module Algo1
use import int.Int
use import ref.Refint
use import Spec
......@@ -70,6 +71,7 @@ end
module Algo2
use import int.Int
use import ref.Refint
use import Spec
......@@ -103,6 +105,7 @@ end
module Algo3
use import int.Int
use import ref.Refint
use import int.ComputerDivision
use import Spec
......@@ -172,6 +175,7 @@ end
module Algo4
use import int.Int
use import ref.Refint
use import Spec
......
......@@ -7,6 +7,7 @@
module Elt
use export int.Int
use export list.List
use export list.Length
use export list.Append
use export list.Permut
......
......@@ -6,6 +6,7 @@
module MergesortQueue
use import int.Int
use import list.List
use import list.Mem
use import list.Length
use import list.Append
......
......@@ -7,6 +7,7 @@
module Relabel
use import list.List
use import list.Mem
use import list.Append
use import list.Distinct
......
......@@ -241,6 +241,7 @@ module Balance
use import String
use import Rope as R
use import int.Int
use import int.Fibonacci
use import int.MinMax
use import array.Array
......
......@@ -92,6 +92,7 @@ end
module MoreHoareLogic
use import int.Int
use import option.Option
use import ref.Ref
use import list.List
use import list.HdTl
......
......@@ -56,6 +56,7 @@ end
module SkewHeaps
use import int.Int
use import bintree.Tree
use export bintree.Size
use export bintree.Occ
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment