package lambdapi
Proof assistant for the λΠ-calculus modulo rewriting
Install
dune-project
Dependency
Authors
Maintainers
Sources
lambdapi-2.3.1.tbz
sha256=ef0c364e355c6c44327e62e79c484b1808d6e144bd6b899d39f0c9c3a351d5f2
sha512=b8b01a1203ea75ae79c59f67e787097f3df7603fc814776fbdd867625165dd00c70918d6edbfdc05c3a63fe7686f95e0523ad106f9da63234a2db33c4d42837e
doc/src/lambdapi.lplib/string.ml.html
Source file string.ml
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 36 37
module S = Stdlib.String include S let to_list : string -> char list = fun s -> let l = ref [] in S.iter (fun c -> l := c :: !l) s; List.rev !l let of_list : char list -> string = fun l -> let b = Buffer.create 37 in List.iter (Buffer.add_char b) l; Buffer.contents b let is_substring : string -> string -> bool = fun e s -> let len_e = S.length e in let len_s = S.length s in let rec is_sub i = if len_s - i < len_e then false else if S.sub s i len_e = e then true else is_sub (i + 1) in is_sub 0 let is_prefix : string -> string -> bool = fun p s -> let len_p = S.length p in let len_s = S.length s in len_p <= len_s && S.sub s 0 len_p = p let for_all : (char -> bool) -> string -> bool = fun p s -> let len_s = S.length s in let rec for_all i = i >= len_s || (p (S.get s i) && for_all (i + 1)) in for_all 0
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>