@the author - I assume you're aware that morphisms in symmetric monoidal categories can be represented using cospans of hypergraphs - do you know if there's a similar combinatorial representation for braided monoidal categories?
@the author - I assume you're aware that morphisms in symmetric monoidal categories can be represented using cospans of hypergraphs - do you know if there's a similar combinatorial representation for braided monoidal categories?
More philosophically, the motto is "write programs as morphisms directly". Rather than writing a term in some type theory which you then (maybe) give a categorical semantics, why not just work directly in a category?
Long term, the goal is to have a compiler which is a stack of categories with functors as compiler passes. The idea being that in contrast to typical compilers where you are "stuck" at a given abstraction level, this would allow you to view your code at various levels of abstractions. So for example, you could write a program, then write an x86-specific optimization for one function which you can then prove correct with respect to the more abstract program specification.
Hellas.AI is building a compiler for categorical deep learning to power decentralised, serverless AI. If you're interested in any of the following, get in touch:
* Category Theory and string diagrams
* Compilers and array programming languages
* Deep Learning/ML/AI and/or GPU programming (e.g. CUDA/ WGSL)
* Building and deploying distributed systems
* Peer-to-peer software and blockchain
If you have project(s) demonstrating your experience in one or more of these areas, get in touch!
Our process is simple: we read code you've written and research you've published, then interview you about it. We don't do tedious coding tests.
Some experience of Rust or a functional language (Haskell, OCaml, any Lisp) is preferred.
Email us at hello@hellas.ai
See:
- NVD page for CVE-2024-9680: https://nvd.nist.gov/vuln/detail/CVE-2024-9680
- Mozilla security advisory: https://www.mozilla.org/en-US/security/advisories/mfsa2024-5...
Want to solve a real problem, help me create custom benchmarks, clean my data, get my small parameter model to reason better etc.
Also, what kind of evaluations for quality of reasoning do you use?
Hellas.AI is building a compiler for categorical deep learning to power decentralised, serverless AI.
We're looking for an experienced Rust engineer. You must have demonstrated:
* Experience in designing and implementing BFT consensus protocols * Ability to engage with academic literature on distributed systems * Understanding of ZK proofs and proof aggregation (you don't need to design these, but you should know how to use them)
Nice-to-have: interest or experience in:
* Deep Learning / ML / AI, GPU programming * Compilers and array programming languages * Category Theory and string diagrams
If you have project(s) demonstrating your experience in one or more of these areas, get in touch!
Our process is simple: we read code you've written and research you've published, then interview you about it. We don't do tedious coding tests.
Email us at hello@hellas.ai