c-cube

open Format

type tp = Ti | To | Arr of tp * tp

let pp_wrap condition pp_fmt fmt x=
  if condition then
    fprintf fmt "(%a)" pp_fmt x
  else
    fprintf fmt "%a" pp_fmt x

c-cube

(* ocamlfind opt -package sequence,benchmark -linkpkg truc.ml -o truc; ./truc*)

open Sequence.Infix

type op =
  | Add
  | Mult
  | Div
  | Minus

c-cube

(* ocamlfind opt -package sequence,benchmark -linkpkg truc.ml -o truc; ./truc*)

open Sequence.Infix

(* all the combinations *)
let rec combs = function
  | [] -> Sequence.return []
  | x :: tail ->
    Sequence.append (combs tail) (combs tail >|= fun l -> x :: l)

c-cube

#require "sequence";;

open Sequence.Infix;;

(* all the combinations *)
let rec combs = function
| [] -> Sequence.return []
| x :: tail ->
  Sequence.append (combs tail) (combs tail >|= fun l -> x :: l);;

c-cube

#require "sequence";;

open Sequence.Infix;;

let rec perms = function
| [] -> Sequence.return []
| x :: tail -> perms tail >>= insert x

and insert x l = match l with
| [] -> Sequence.return [x]

c-cube

(* ocamlfind opt -g -package zarith -package containers.iter -linkpkg primes.ml -o primes *)

module L = CCLazy_list;;

let gen_int =
  let n = ref Z.one in
  fun () ->
    let x = !n in
    n := Z.succ !n;
    Some x

c-cube

module G = struct
  type 'a t = unit -> 'a option

  let (--) i j =
    let r = ref i in
    fun () ->
      if !r > j then None
      else (let x = !r in incr r; Some x)

c-cube

|

a | b c | d

c-cube

QTest

c-cube

type 'a hlist =
  | HNil : unit hlist
  | HCons : 'a * 'b hlist -> ('a * 'b) hlist

(** Description of type ['a] *)
type 'a ty =
  | Int : int ty
  | Bool : bool ty
  | Sum : 's sum -> 's ty