Hello everyone, this is my first post in hubFS and I apologize in advance if I commit a mistake.
I am a student of computer engineering at the University of Catania and I'm doing an internship at a local company. Should I make an analysis of reachability of parts of a graph: a node can be reached if a certain boolean condition is verified. Each node knows only its predecessor, there are different types of nodes and not all nodes have at guard a condition to be verified. The rule is placed in a file. I made ​​the parsing of the rule, I have selected (through the use of discriminated union) and ordered the nodes in accordance with the flow of execution. Now, I should make a kind of static analysis to inform the user that, for specified conditions, some nodes are unreachable. There are multiple entry points to the graph, but only one exit point.
The professor told me to translate the Boolean conditions in F# and check it through compilation. But I noticed that the F# compiler does not give me a warning even though I have written the following code:

1
2
3
4
5

let tryCondition cond = 
    if cond then
        if not cond then "Not reacheble"
        else "Reacheble"
    else "bye"

or

1
2
3
4
5
6

let tryConditionTwo num =
    match num with
    | x as t when x > 0 -> match t with
                           | y when y < 0 -> "Not reacheble"
                           | _ -> "Reacheble"
    | _ -> "bye"

Is there a better solution and not too much complex to implement in F# to solve this problem? Or is there an option in the compiler that allows me to get information about unreachable code?
Thanks in advance to anyone who can help me!