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.

Sign up for GitHub

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

Jump to bottom

Decidable reachability for finite quivers #1198

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

Decidable reachability for finite quivers #1198

wants to merge 5 commits into from

Conversation

stschaef
Copy link
Contributor

Here we prove that given a finite Quiver, it is decidable to determine if there exists a path between two vertices.

@stschaef
Copy link
Contributor Author

stschaef commented Feb 26, 2025 •
edited
Loading

I have been maintaining a small extension of Cubical to support an Agda development for building verified parsers

This "small extension" keeps growing. I have more substantive changes to come, mostly for reasoning about DecProps. I think its likely suited a different PR, so I am trying to gradually splinter off pieces that could be used more generally, with this reachability bit being the first

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@anshwad10 anshwad10 anshwad10 left review comments

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@stschaef @anshwad10