Agent skill

interaction-nets

Lafont's interaction nets for optimal parallel λ-reduction. Graph rewriting

majiayu000github.com/majiayu000GitHub ↗
claude-codeMIT
Install
npx skills add majiayu000/claude-skill-registry --skill interaction-nets --agent claude-code

Same command for any agent — swap --agent for codex, cursor, copilot.

Facts
Files in the skill folder: 2
SKILL.md size: 6 KB
Bundled scripts: none
Version: 1.0.0
Path: skills/ai-ml/interaction-nets/SKILL.md
Open the folder on GitHub →
Where it comes from
Stars: 534
Language: HTML

Weekly change comes from our own snapshots, not the repository page — it measures attention, not adoption.

From the SKILL.md

# Interaction Nets Skill > *"The only model where parallelism is not an optimization but the semantics itself."* ## Core Concept Interaction nets are a graphical model of computation where: - **Nodes** (agents) have typed ports - **Wires** connect ports - **Reduction** happens when two **principal ports** meet - **No global control** — all reductions are local and can happen in parallel ``` ┌─●─┐ ┌───┐ ───┤ ├─── → ───┤ ├─── └─●─┘ └───┘ principal ports result meet ``` ## Why It's Strange 1. **No evaluation order** — unlike λ-calculus, no choice between CBV/CBN 2. **Optimal sharing** — work is never duplicated (Lamping's algorithm) 3. **Massively parallel** — every independent redex reduces simultaneously 4. **Linear by default** — resources used exactly once (linear logic connection) ## Interaction Combinators Lafont's universal basis (3 agents): ``` ε (eraser) δ (duplicator) γ (constructor) │ /│\ /│\ ● ● │ ● ● │ ● │ │ ● ● ``` ### Reduction Rules ``` γ ─● ●─ γ → cross-wire (annihilation) δ ─● ●─ δ → cross-wire (annihilation) γ ─● ●─ δ → duplication (commutation) ε ─● ●─ γ → erase both aux ports ε ─● ●─ δ → erase both aux ports ``` ## HVM / Bend Implementation [Bend](https://bend-lan

What's inside
Steps it walks through
  1. Core Concept
  2. Why It's Strange
  3. Interaction Combinators
  4. Reduction Rules
  5. HVM / Bend Implementation
  6. Install & Run
  7. λ-Calculus Encoding
  8. Abstraction (λx.M)
  9. Application (M N)
  10. β-reduction as Interaction
  11. Optimal Reduction
  12. Symmetric Interaction Combinators
  13. Code Examples
  14. Minimal Interaction Net in Julia
Ships with 1 file
  • metadata.json
Commands it runs
Install Bend
cargo install hvm
cargo install bend-lang
Run with parallelism
bend run program.bend -p 8  # 8 threads
More from claude-skill-registry
All skills →
About this skill
What does the interaction-nets skill do?

Lafont's interaction nets for optimal parallel λ-reduction. Graph rewriting

How do I install it?

Run `npx skills add majiayu000/claude-skill-registry --skill interaction-nets --agent claude-code` — it drops the skill into your project so the agent can pick it up. Swap the --agent value for codex, cursor or copilot if you use one of those.

Where does this skill come from?

From majiayu000/claude-skill-registry, a repository with 534 stars. We read it straight from the repository tree rather than a submitted listing, so what you see here is what is actually published.

Is a popular skill a good skill?

Not necessarily. Stars measure attention, not adoption — a repository can trend for a week and be abandoned. That is why we show the weekly change from our own snapshots next to the total, instead of a single flattering number.

Keep going