awesome-repositories.com
المدونة
MCP
awesome-repositories.com

اكتشف أفضل مستودعات المصادر المفتوحة باستخدام بحث مدعوم بالذكاء الاصطناعي.

استكشفعمليات بحث منسقةبدائل مفتوحة المصدربرمجيات ذاتية الاستضافةالمدونةخريطة الموقع
المشروعخادم MCPحولكيفية ترتيب النتائجالصحافة
قانونيالخصوصيةالشروط
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 مستودعات

Awesome GitHub RepositoriesInteraction Net Engines

Computational engines that reduce expressions by rewriting local connections in a graph.

Distinct from Graph-Based Computational Execution: Distinct from general computational graphs: focuses on interaction net rewriting rules rather than static DAGs.

Explore 2 awesome GitHub repositories matching scientific & mathematical computing · Interaction Net Engines. Refine with filters or upvote what's useful.

Awesome Interaction Net Engines GitHub Repositories

اعثر على أفضل المستودعات باستخدام الذكاء الاصطناعي.سنبحث عن أفضل المستودعات المطابقة باستخدام الذكاء الاصطناعي.
  • higherorderco/bendالصورة الرمزية لـ HigherOrderCO

    HigherOrderCO/Bend

    19,175عرض على GitHub↗

    Bend is a high-level parallel programming language and compiler designed to execute code across multi-core CPUs and GPUs automatically. By translating functional source code into a graph-based intermediate representation, it enables massive parallel execution without requiring manual management of threads, locks, or atomic operations. The runtime operates as an interaction net engine, where computations are represented as networks of nodes that reduce through local rewriting rules. This model utilizes a work-stealing scheduler to distribute tasks across thousands of hardware threads, ensuring

    Executes computations by reducing networks of interacting nodes through local rewriting rules.

    Rust
    عرض على GitHub↗19,175
  • higherorderco/hvm2الصورة الرمزية لـ HigherOrderCO

    HigherOrderCO/HVM2

    11,290عرض على GitHub↗

    HVM2 is a high-performance execution environment for pure functional programs, implemented as a systems-level runtime in Rust. It functions as a massively parallel functional runtime that uses interaction combinators to achieve automatic parallelism across multi-core CPUs and GPUs. The project distinguishes itself by using a graph-rewriting computational model to execute programs via local reduction rules, which eliminates the need for manual locks or atomic operations. It employs beta-optimal reduction and lazy evaluation to optimize higher-order functions and eliminate redundant computation

    Uses a graph-rewriting engine to execute programs via local reduction rules.

    Cuda
    عرض على GitHub↗11,290
  1. Home
  2. Scientific & Mathematical Computing
  3. Data Modeling and Processing
  4. Computational Graphs
  5. Graph-Based Computational Execution
  6. Interaction Net Engines