‘let rec… and…’ is the syntax you seek.
let rec F() =
G()
and G() =
F()
See also Adventures in F# Co-Recursion.
More Related Contents:
- F# : not sure how to start [closed]
- Understanding F# Value Restriction Errors
- Handy F# snippets [closed]
- How to constrain one type parameter by another
- F# Functions vs. Values
- F# Tail Recursive Function Example
- Shadowing and Nested function
- Use of `inline` in F#
- F# forward type declarations
- How to Async.AwaitTask on plain Task (not Task)?
- How can i convert between F# List and F# Tuple?
- Why are functions in OCaml/F# not recursive by default?
- Why isn’t there a protected access modifier in F#?
- Using keywords as identifiers in F#
- Global operator overloading in F#
- How to write a function for generic numbers?
- F#: let mutable vs. ref
- Correct version of Fsharp.Core
- F# getting a list of random numbers
- Why is F#’s type inference so fickle?
- While or Tail Recursion in F#, what to use when?
- Help me to explain the F# Matrix transpose function
- F# Split list into sublists based on comparison of adjacent elements
- F# changes to OCaml [closed]
- F# interface inheritance failure due to unit
- What are the benefits of using C# vs F# or F# vs C#? [closed]
- Finding all combinations of well-formed brackets
- F# generics / function overloading syntax
- Does F# have generic arithmetic support?
- Splitting a list of items into two lists of odd and even indexed items