open-hypergraphs 0.2.8

Data-Parallel Algorithms for Open Hypergraphs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74

<div style="text-align: center;" align="center">
<h1>open hypergraphs</h1>

[![Crate][crate_img]][crate_link]
[![Documentation][docs_img]][docs_link]
[![License][license_img]][license_file]

</div>

Open Hypergraphs are a general, differentiable and data-parallel datastructure for syntax. Here’s a few examples of suitable uses:

- Differentiable array programs for deep learning (in [catgrad][catgrad]).
- Proofs and terms in first order logic
- Programs in the λ-calculus
- Circuits with feedback

This code is an implementation of the paper
[Data-Parallel Algorithms for String Diagrams](https://arxiv.org/pdf/2305.01041).

# Features

- An imperative interface
  for constructing open hypergraphs in Rust
  the [lax module](https://docs.rs/open-hypergraphs/latest/open_hypergraphs/lax/index.html))
- Data-parallel algorithms for algebraic operations
  (the [strict module](https://docs.rs/open-hypergraphs/latest/open_hypergraphs/strict/index.html))
- Data-parallel diagram layering and decomposition
- Functors, including optic transformation for ahead-of-time differentiation of
  syntax

# Examples

An example for defining a simple expression language ([polynomial
circuits](https://www.sciencedirect.com/science/article/pii/S2352220823000469))
and evaluating its terms is given [here](./examples/polycirc.rs).

A complete example showing term construction, rendering as SVG using [open-hypergraphs-dot][oh-dot], and
serialization to JSON can be found [here](./examples/serde/).
This example produces the following open hypergraph:

![image](./images/subtract.svg)

which serializes to JSON as below:

```json
{
    "sources": [3,0],
    "targets": [4],
    "hypergraph": {
        "nodes":[
            {"Interval":{"lower":0,"upper":1}},
            "Int","Int","Int","Int"
        ],
        "edges": ["Cast","Neg","Add"],
        "adjacency": [
            {"sources":[0],"targets":[1]},
            {"sources":[1],"targets":[2]},
            {"sources":[3,2],"targets":[4]}
        ],
        "quotient":[[],[]]
    }
}
```

[crate_link]: https://crates.io/crates/open-hypergraphs "Crate listing"
[crate_img]: https://img.shields.io/crates/v/open-hypergraphs.svg?style=for-the-badge&color=f46623 "Crate badge"
[docs_link]: https://docs.rs/open-hypergraphs/latest/open-hypergraphs "Crate documentation"
[docs_img]: https://img.shields.io/docsrs/open-hypergraphs/latest.svg?style=for-the-badge "Documentation badge"

[license_file]: https://github.com/hellas-ai/open-hypergraphs/blob/master/LICENSE-MIT "Project license"
[license_img]: https://img.shields.io/crates/l/open-hypergraphs.svg?style=for-the-badge "License badge"

[oh-dot]: https://github.com/hellas-ai/open-hypergraphs-dot
[catgrad]: https://catgrad.com