Modified ocaml backend to use ocamlfind for linksem and lem

Fixed test cases for ocaml backend and interpreter

1 files changed, 0 insertions, 103 deletions

diff --git a/lib/ocaml_rts/linksem/src_lem_library/lem.ml b/lib/ocaml_rts/linksem/src_lem_library/lem.ml
deleted file mode 100644
index 2ff0090f..00000000
--- a/lib/ocaml_rts/linksem/src_lem_library/lem.ml
+++ /dev/null
@@ -1,103 +0,0 @@
-(* ========================================================================== *)
-(* Tuples                                                                     *)
-(* ========================================================================== *)
-
-
-let pair_equal eq1 eq2 (a1, b1) (a2, b2) =
-  (eq1 a1 a2) && (eq2 b1 b2)
-
-let pair_swap (v1, v2) = (v2, v1)
-
-let curry f v1 v2 = f (v1, v2)
-
-let uncurry f (v1, v2) = f v1 v2
-
-(* ========================================================================== *)
-(* Orderings                                                                  *)
-(* ========================================================================== *)
-
-let orderingIsLess r = (r < 0)
-let orderingIsGreater r = (r > 0)
-let orderingIsEqual r = (r = 0)
-
-let ordering_cases (r : int) (lt : 'a) (eq : 'a) (gt : 'a) : 'a =  
-  (if (r < 0) then lt else
-   if (r = 0) then eq else gt)
-
-let orderingEqual r1 r2 = 
-  ordering_cases r1 (orderingIsLess r2) (orderingIsEqual r2) (orderingIsGreater r2)
-
-
-(* ========================================================================== *)
-(* Lists                                                                      *)
-(* ========================================================================== *)
-
-
-let list_null = function
-  | [] -> true
-  | _ -> false
-
-let rec lexicographic_compare cmp l1 l2 : int = (match (l1,l2) with
-  | ([], []) -> 0
-  | ([], _::_) -> -1
-  | (_::_, []) -> 1
-  | (x::xs, y::ys) -> begin  
-       ordering_cases (cmp x y) (-1) (lexicographic_compare cmp xs ys) (1)
-    end
-)
-
-let rec lexicographic_less less less_eq l1 l2 = ((match (l1,l2) with
-  | ([], []) -> false
-  | ([], _::_) -> true
-  | (_::_, []) -> false
-  | (x::xs, y::ys) -> ((less x y) || ((less_eq x y) && (lexicographic_less less less_eq xs ys)))
-))
-
-let rec lexicographic_less_eq less less_eq l1 l2 = ((match (l1,l2) with
-  | ([], []) -> true
-  | ([], _::_) -> true
-  | (_::_, []) -> false
-  | (x::xs, y::ys) -> (less x y || (less_eq x y && lexicographic_less_eq less less_eq xs ys))
-))
-
-let rec list_index l n = (match l with 
-  | []      -> None
-  | x :: xs -> if n = 0 then (Some x) else list_index xs (n - 1)
-)
-
-
-(* ========================================================================== *)
-(* Options                                                                    *)
-(* ========================================================================== *)
-
-let is_none = function
-  | None -> true
-  | Some _ -> false
-
-let is_some = function
-  | None -> false
-  | Some _ -> true
-
-let option_case d f mb = (match mb with 
-  | Some a -> f a
-  | None   -> d
-)
-
-let option_default d = function
-  | Some a -> a
-  | None   -> d
-
-let option_map f = function
-  | Some a -> Some (f a)
-  | None   -> None
-
-let option_bind m f =
-  match m with
-    | Some a -> f a
-    | None   -> None
-
-let option_equal eq o1 o2 = match (o1, o2) with
-  | (None, None)       -> true
-  | (None, Some _)     -> false
-  | (Some _,  None)    -> false
-  | (Some x1, Some x2) -> eq x1 x2