Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Conegation rewriting #18

Closed
kris-brown opened this issue May 1, 2023 · 0 comments · Fixed by #31
Closed

Conegation rewriting #18

kris-brown opened this issue May 1, 2023 · 0 comments · Fixed by #31
Assignees

Comments

@kris-brown
Copy link
Collaborator

Using the logic of biheyting algebras (described here) it should be straightforward to implement conegation rewriting (described here).

This semantics would be an intermediate between DPO (don't apply rule if it produces a dangling connection) and SPO (cascade delete until there are no dangling connections). It would still apply the rule, adding/deleting/merging things, except it will skip deleting anything in particular that would produce a dangling connection.

The corresponding PR could also implement the pushout complement code in terms of biheyting algebras (although the check if the dangling/identification conditions hold will remain unchanged).

@kris-brown kris-brown self-assigned this Sep 14, 2023
@kris-brown kris-brown linked a pull request Oct 13, 2023 that will close this issue
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 a pull request may close this issue.

1 participant