https://github.com/statusfailed/cartographer-har
https://github.com/statusfailed/cartographer-har
Last synced: 5 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/statusfailed/cartographer-har
- Owner: statusfailed
- Created: 2021-04-30T15:01:53.000Z (almost 5 years ago)
- Default Branch: master
- Last Pushed: 2023-02-09T18:03:11.000Z (about 3 years ago)
- Last Synced: 2025-10-05T06:56:20.944Z (5 months ago)
- Language: Python
- Size: 36.1 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# HAR
This is an implementation of HARs: a datastructure (and algorithms) for
implementing string diagrams using sparse adjacency matrices.
It accompanies [this paper](https://arxiv.org/abs/2105.09257)
and [this talk](https://youtu.be/We7FuoOCxyA?t=7937)
For the **sparse-matrix-based implementation**, see the file
[cartographer_har/sparse_slice.py](cartographer_har/sparse_slice.py)
For **HAR benchmarks**, see the [benchmarks](./benchmarks) folder
For the corresponding **catlab benchmarks**, see
[catlab-benchmark.jl](./julia/catlab-benchmark.jl)
# Raw data of experiments
See the [./results](./results) folder.
**NOTE CAREFULLY**: the data in `catlab-results.csv` uses time in nanoseconds,
while the data in `har-results.csv` has time in seconds.