Can discriminated unions refer to each other?

I'm building an expression tree using discriminated uni开发者_如何学编程ons. The below code:

type IntExpression =
    | TrueIsOne of BoolExpression

type BoolExpression =
    | LessThan of IntExpression * IntExpression
    | And of BoolExpression * BoolExpression
    | Or of BoolExpression * BoolExpression
    | Bool of bool

throws an error because BoolExpression is not defined. Swapping the definitions just results in the reverse (IntExpression is not defined) as you would expect.

Is there a way around this?

---

Yes, use and to group type definitions with inter-dependencies:

type IntExpression =
    | TrueIsOne of BoolExpression

and BoolExpression =
    | LessThan of IntExpression * IntExpression
    | And of BoolExpression * BoolExpression
    | Or of BoolExpression * BoolExpression
    | Bool of bool

---

"and" works generally for types with mutual dependencies. That is, it works for all types, such as discriminated unions, as shown by Mau, classes, records and mutually recursive functions.

Non terminating example:

let rec foo x = bar x
and bar x = foo x

---

Perhaps this will work:

type IntExpression =
  ...
and BoolExpression = 
  ...

(Information taken from this page on MSDN.)