Skip to content

Conversation

@mstn
Copy link
Contributor

@mstn mstn commented Jan 16, 2026

Context

Allow lax composition for open lax hypergraphs: graphs are composed without checking if labels match.

Motivating example

Suppose that an hypergraph represents programs where nodes are types and edges are builtin functions. During the graph construction we use type variables instead of types for some nodes whose type cannot be determined. In those case, it is convenient to compose laxly and resolve the types later by unification/substitution.

out

@mstn mstn changed the title implement lax compose Lax compose for open lax hypergraphs Jan 16, 2026
@statusfailed statusfailed merged commit 6de3f9e into hellas-ai:master Jan 19, 2026
2 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants