Interaction Trees

Enables representation of side-effecting programs like I/O and state within Coq's pure logic, using coinductive trees as demonstrated in the core ITree.ITree module.

Provides theorems and tools for proving program equivalence through bisimulation, facilitating rigorous correctness proofs as highlighted in ITree.ITreeFacts.

Supports defining custom event types and handlers, allowing flexible modeling of various computational effects, shown in the Events module and tutorials.

Includes detailed tutorials and example files like ReadmeExample.v, helping users learn and apply the library effectively, as noted in the README.