I m trying to simplify this function as much as possible let rec f2 a b c d = match (a,b) with |true, false -> a && c || f2 b c a d (*a is true b is false so it s always true*) |true, c -> d && c || f2 b c a d (*always true*) |false, _ -> let d = a || b || c…

Simplifying a function OCaml

XVilka April 26, 2020, 5:53am 6

Try to write it in SMT and run the solver against it.

Topic		Replies	Views
What is the simplest example of mutual recursion? Learning	4	8464	December 28, 2020
Optimize a simple piece of code Community	8	707	February 26, 2022
What does let rec *****= function means? Learning	12	5191	May 2, 2019
What this code mean in ocaml Learning	1	820	October 18, 2017
Conversion patterns of pattern matching to disjoint patterns Learning	7	1245	May 25, 2020