OCaml library for partially ordered maps
-
Updated
Nov 5, 2024 - OCaml
OCaml library for partially ordered maps
POET (Partial Order Exploration Tools)
C program to display whether the given relation represents partial ordering poset and equivalence relation or not.
LaTeX package for Hasse diagrams of partially ordered sets (in mathematics of finite partial orders and in causal set theory).
A library for dynamic analysis of multithreaded POSIX C programs
Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
A crate for representing finite partial orders
Add a description, image, and links to the partial-orders topic page so that developers can more easily learn about it.
To associate your repository with the partial-orders topic, visit your repo's landing page and select "manage topics."