graflang 0.1.0__tar.gz

graflang-0.1.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

graflang-0.1.0/PKG-INFO

@@ -0,0 +1,274 @@
+Metadata-Version: 2.4
+Name: graflang
+Version: 0.1.0
+Summary: GraphLang: a physics-inspired, topologically grounded language for self-revising agentic workflows (one command line: `graf`)
+Author: Wen Gong
+License: Apache-2.0
+Project-URL: Homepage, https://github.com/digital-duck/graflang
+Project-URL: Repository, https://github.com/digital-duck/graflang
+Project-URL: Issues, https://github.com/digital-duck/graflang/issues
+Project-URL: Changelog, https://github.com/digital-duck/graflang/blob/main/CHANGELOG.md
+Keywords: graph-lang,agentic-ai,interaction-nets,topology,llm,cedar
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Software Development :: Interpreters
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: click>=8.1
+Requires-Dist: ruamel.yaml>=0.18
+Requires-Dist: networkx>=3.2
+Requires-Dist: jsonschema>=4.20
+Requires-Dist: cedarpy>=4.8
+Requires-Dist: dd-llm[openai]>=0.2.0
+Requires-Dist: rich>=13.7
+Requires-Dist: dd-logging>=0.2.0
+Requires-Dist: zinet>=0.2.0
+Provides-Extra: spl
+Requires-Dist: spl-llm>=3.4; extra == "spl"
+Provides-Extra: anthropic
+Requires-Dist: dd-llm[anthropic]>=0.2.0; extra == "anthropic"
+Provides-Extra: gemini
+Requires-Dist: dd-llm[gemini]>=0.2.0; extra == "gemini"
+Provides-Extra: vis
+Requires-Dist: zinet[pyvis]>=0.2.0; extra == "vis"
+Provides-Extra: graphify
+Requires-Dist: zinet[graphify]>=0.2.0; extra == "graphify"
+Provides-Extra: grafc
+Requires-Dist: jinja2>=3.1; extra == "grafc"
+Provides-Extra: dev
+Requires-Dist: pytest>=7.4; extra == "dev"
+Dynamic: license-file
+
+# GraphLang
+
+**A physics-inspired, topologically grounded language for self-revising agentic workflows.**
+
+GraphLang flips the script on agentic AI. Where LangGraph and AutoGen use Python code to *describe* a graph, GraphLang treats the graph as the **primary, executable source of truth**. The topology is the program. The LLM doesn't write code — it mutates the graph.
+
+> **Status:** Early prototype. Private development repository.  
+> **Companion:** [SPL.py](https://github.com/digital-duck/SPL.py) — the declarative workflow language that GraphLang elevates.  
+> **Paper:** *GraphLang: A Physics-Inspired, Topologically Grounded Language for Self-Revising Agentic Workflows* (in preparation; no draft in this repository yet)
+
+---
+
+## The Paradigm Shift
+
+| | Imperative Frameworks (LangGraph, AutoGen) | GraphLang |
+|---|---|---|
+| **Source of truth** | Python code that describes a graph | The graph itself |
+| **LLM's role** | Generate text/code | Mutate the topology |
+| **Parallelism** | `asyncio.gather` + race conditions | Interaction Nets (confluent for the deterministic core; LLM-sampling nodes and `LOOP` are not) |
+| **Safety** | Scattered `if/else` guardrails | Declarative Cedar policies, enforced at runtime (Rust compilation planned) |
+| **Self-revision** | Rewrite the Python file | Output a validated graph delta |
+| **Visualization** | Lossy Mermaid translation | First-class, interactive topology |
+
+---
+
+## Two graph formats, one family
+
+GraphLang workflows live in `*.graph.yaml` and are run, checked, compiled and drawn by the one command `graf`. They are not
+[zinet](https://github.com/digital-duck/zinet) graphs: zinet stores a *static* dependency graph (`primitives:`, `concepts:`,
+`applications:`), while a workflow is *executable* (typed nodes with ports, `triggers` and `binds` edges, loops and retries,
+Cedar policies). Both are plain YAML that persists a graph, and the file name is only a convention, so `graf` tells the files
+apart by content (`workflow:` with `nodes:` and `edges:` is a workflow) and says what a zinet or ConceptBook file is instead of
+failing on a schema error. The two share graph code: `graf vis` draws through zinet's engines (`zinet.vis`).
+
+## Core Innovations
+
+### 1. Physics-Inspired Execution
+GraphLang is grounded in **Lafont's Interaction Nets** — a mathematically proven model for deterministic, concurrent graph rewriting. Computation occurs via local rewrite rules when agents interact:
+
+- **`GENERATE`** — probabilistic agents (LLM calls)
+- **`SOLVE` / `ASSERT`** — deterministic agents (SymPy, Lean, Python eval)
+- **`FORK` / `JOIN`** — explicit fan-out and barrier (parallelism without race conditions)
+- **`LOOP`** — cyclic control flow (test-gated retry)
+- **`MUTATE`** — the self-revising operator (LLM outputs validated graph deltas)
+- **`GUARD`** — policy checkpoints backed by Cedar
+
+### 2. Three-Tier Composition
+Keep the topology clean while preserving the full expressive power of SPL:
+
+- **Tier 1 (Inline):** Tiny prompts and expressions directly in the YAML
+- **Tier 2 (Reference):** External `.spl` procedures, `.md` prompts, `.cedar` policies
+- **Tier 3 (Sub-graph):** Composite nodes — a graph within a graph (e.g., a `LOOP` node encapsulating a 5-step internal topology)
+
+### 3. Policy-Grounded Safety
+Safety isn't an afterthought. [Cedar](https://www.cedarpolicy.com/) policies are first-class topological constructs (`GUARD` nodes) that are:
+- Evaluated at runtime by `grafr` (dynamic, hot-reloadable)
+- Planned: compiled to zero-cost Rust `match` statements by `grafc` (deployment; `grafc` is still a stub)
+
+The LLM can propose mutations, but only those that pass the Cedar policy check are applied.
+
+### 4. Compilation to Rust (Downstream)
+**Planned; `grafc` is currently a stub.** `grafc` is meant to compile the Graph IR + Cedar policies into a memory-safe, high-performance Rust binary. This is a **downstream deployment optimization**, not the core innovation. The innovation is the topological execution model itself.
+
+---
+
+## Quick Start
+
+```bash
+# Install the dynamic interpreter (development)
+pip install -e ".[dev]"        # `claude_cli`, `ollama`, `openai`, `openrouter` work as is; `.[anthropic]`, `.[gemini]` add SDKs
+
+# Run a workflow (default adapter is `claude_cli`; `--adapter mock` calls no LLM)
+graf run cookbook/code_pipeline/code_pipeline.graph.yaml \
+    --adapter ollama \
+    --param spec="Write a binary search function"
+
+# Compile to Rust (deployment; planned, grafc is a stub)
+# Cedar policies are referenced from the graph's `resources.policies` block
+# (shared policies live in graphlang/policies/).
+graf compile cookbook/code_pipeline/code_pipeline.graph.yaml \
+    --target rust \
+    -o code_pipeline
+```
+
+---
+
+## The Flagship Example: `code_pipeline.graph.yaml`
+
+A neurosymbolic, self-revising code generation pipeline. This single file demonstrates the entire paradigm:
+
+```yaml
+version: "1.0-graph"
+
+workflow:
+  name: "code_pipeline"
+  inputs:
+    - {name: "spec", type: "TEXT"}
+    - {name: "max_cycles", type: "INTEGER", default: 3}
+  outputs:
+    - {name: "docs", type: "TEXT"}
+
+resources:
+  procedures:
+    analyze_spec: "./00_analyze_spec.spl"
+    generate_code: "./01_generate_code.spl"
+    review_code: "./02_review_code.spl"
+    test_code: "./04_test_code.spl"
+    # ... (8 procedures in the full file, 00-07)
+  policies:
+    mutation_safety: "../../graphlang/policies/mutation_safety.cedar"
+
+nodes:
+  - id: "analyze"
+    type: "GENERATE"
+    config: {procedure_ref: "procedures.analyze_spec"}
+    ports: ["trigger", "complete", "in_spec", "out_analysis"]
+
+  - id: "spec_gate"
+    type: "EVALUATE"
+    config: {condition: "contains(@in_analysis, '[READY]')"}   # @in_analysis is this node's own in_* port, fed by a `binds` edge
+    ports: ["trigger", "pass", "fail", "in_analysis"]
+
+  - id: "test_gated_loop"
+    type: "LOOP"
+    config:
+      # @in_max_cycles is a LOOP input port; @test_passed and @cycle are loop state
+      # (the previous iteration's outputs and the 0-based counter), not declared ports.
+      condition: "NOT @test_passed AND @cycle < @in_max_cycles"
+      subgraph:
+        nodes:
+          - {id: "gen", type: "GENERATE", config: {procedure_ref: "procedures.generate_code"}}
+          - {id: "rev", type: "GENERATE", config: {procedure_ref: "procedures.review_code"}}
+          - {id: "test", type: "SOLVE", config: {procedure_ref: "procedures.test_code"}}
+          - {id: "guard", type: "GUARD", config: {policy_ref: "policies.mutation_safety"}}
+        edges:
+          - {source: "gen.complete", target: "rev.trigger", type: "triggers"}
+          - {source: "rev.complete", target: "test.trigger", type: "triggers"}
+          - {source: "test.complete", target: "guard.trigger", type: "triggers"}
+          - {source: "guard.allow", target: "gen.trigger", type: "triggers"}  # Safe retry
+    ports: ["trigger", "loop", "exit", "in_spec", "out_final_code"]
+
+edges:
+  - {source: "analyze.complete", target: "spec_gate.trigger", type: "triggers"}
+  - {source: "analyze.out_analysis", target: "spec_gate.in_analysis", type: "binds"}
+  - {source: "spec_gate.pass", target: "test_gated_loop.trigger", type: "triggers"}
+  # ... (full file in cookbook/code_pipeline/)
+```
+
+**What makes this revolutionary:**
+- The `LOOP` node is a **Tier 3 composite** — click it in the UI to see the internal 4-step topology
+- The `GUARD` node enforces Cedar policies before allowing a retry
+- The closure check (spec → code → spec' → judge) is a clean topological branch, not buried in `if/else`
+- The LLM can propose mutations via `MUTATE` nodes, but only those passing Cedar are applied
+
+---
+
+## Architecture
+
+```
+┌─────────────────────────────────────────────────────────────┐
+│  GraphLang Toolchain                                        │
+├─────────────────────────────────────────────────────────────┤
+│                                                             │
+│   Source              IR              Runtime     Deployment │
+│   ──────              ──              ───────     ────────── │
+│                                                             │
+│   *.graph.yaml ──► grafr ──► NetworkX/Python (dev)          │
+│                  │                                          │
+│                  └──► grafc ──► Rust binary (prod)          │
+│                                                             │
+│   *.cedar ─────────┘  (compiled inline to Rust match)       │
+│   *.spl ───────────┘  (Tier 2 procedure references)         │
+│                                                             │
+└─────────────────────────────────────────────────────────────┘
+```
+
+---
+
+## Relationship to SPL.py
+
+[**SPL.py**](https://github.com/digital-duck/SPL.py) is the declarative workflow language that GraphLang elevates. SPL provides:
+
+- The `GENERATE` / `EVALUATE` (probabilistic) and `SOLVE` / `ASSERT` (deterministic) vocabulary
+- The 78-recipe cookbook and its empirical validation
+- The neurosymbolic verifier ladder (SymPy → SageMath → Lean 4)
+- The LLM adapters (Ollama, Claude, OpenAI, Momagrid, etc.)
+
+GraphLang takes SPL's proven semantics and gives them a **topological execution model**. SPL workflows can be automatically ported to GraphLang via the `spl2graph` transpiler.
+
+---
+
+## Roadmap
+
+- [x] Core vocabulary design (physics-inspired, pruned from SPL)
+- [x] JSON Schema for Graph IR (3-tier composition)
+- [x] Cedar integration in `grafr` (`GUARD` and `MUTATE` checks via `cedarpy`)
+- [x] Flagship example (`code_pipeline.graph.yaml`)
+- [x] `grafr` Python interpreter (NetworkX-based topological executor)
+- [ ] `grafc` Rust compiler (Graph IR + Cedar → Rust AST)
+- [x] `graf vis`: read a workflow as a graph (control flow first, data edges on demand, loops that collapse to one box)
+- [ ] Visual IDE: author and edit a workflow in the graph view (add and connect nodes and ports, edit their config, validate while you edit, write the `*.graph.yaml` with its comments kept, run from the view). Planned; the plan is in zinet's `docs/DEV/readme-todo.md`.
+- [ ] Interactive Streamlit UI (drill-down visualization of Tier 3 composites)
+- [ ] `spl2graph` transpiler (port all 78 SPL recipes)
+- [ ] Paper submission (NeurIPS / ICLR)
+
+---
+
+## License
+
+Apache 2.0. See [LICENSE](./LICENSE).
+
+---
+
+## Citation
+
+```bibtex
+@misc{gong2026graflang,
+  title={GraphLang: A Physics-Inspired, Topologically Grounded Language for Self-Revising Agentic Workflows},
+  author={Gong, Wen},
+  year={2026},
+  howpublished={\url{https://github.com/digital-duck/graflang}},
+  note={Forthcoming paper}
+}
+```
+
+---
+
+> *"The graph is not a byproduct of the code. The graph **is** the code."*