# Tacit 1.0.0 - Combinators!

**URL:** <https://discuss.ocaml.org/t/tacit-1-0-0-combinators/17142>\
**Category:** Community\
**Tags:** opam, announce\
**Created:** [August 19, 2025, 10:36pm UTC](https://discuss.ocaml.org/t/tacit-1-0-0-combinators/17142 "2025-08-19T22:36:21Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![arutonee](https://sea2.discourse-cdn.com/flex020/user_avatar/discuss.ocaml.org/arutonee/32/6130_2.png) [@arutonee](https://discuss.ocaml.org/u/arutonee)\
**Post date:** [August 19, 2025, 10:36pm UTC](https://discuss.ocaml.org/t/tacit-1-0-0-combinators/17142/1 "2025-08-19T22:36:21Z")

</div>

Partially as a beginner project (I am _very much_ a beginner- if anyone else finds the package useful and feels like something should be changed or knows more fun combinators, feel free to make a PR as I have no clue what I’m doing), and partially just because I personally want a relatively complete combinator library, `tacit` is now on opam! Now you can write `let nth_root = C.c (C.phi1 Float.pow C.k (C.b1 (( /. ) 1.) C.ki))` if you wanted to, for whatever reason 😉

---

<div class="post-metadata">

**Author:** ![xvw](https://sea2.discourse-cdn.com/flex020/user_avatar/discuss.ocaml.org/xvw/32/2041_2.png) [@xvw](https://discuss.ocaml.org/u/xvw)\
**Post date:** [August 20, 2025, 12:21am UTC](https://discuss.ocaml.org/t/tacit-1-0-0-combinators/17142/2 "2025-08-20T00:21:47Z")

</div>

Here is the package page: [tacit 1.0.0 (latest) · OCaml Package](https://ocaml.org/p/tacit/latest)  
here is the repository: [GitHub - arutonee1/tacit: A set of combinators from combinatory logic for OCaml.](https://github.com/arutonee1/tacit)