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

A small example of transporting theory between two equivalent representations of lists #445

Merged
merged 15 commits into from Oct 18, 2020

Conversation

mortberg
Copy link
Collaborator

The equivalence is as simple as possible and the goal is just to illustrate how one can transport results either directly or using the SIP

As far as I can tell this is the only example of how to use the SIP machinery which isn't polluted by code relating records and Sigma-types...

-- We can now get the property for ++' and rev' via the SIP
goal : (xs ys : List' A) → rev' (xs ++' ys) ≡ rev' ys ++' rev' xs
goal = transferAxioms rawUnivalentStr List-Struct List'-RawStruct
(ListEquiv , toList'-++ , toList'-rev) .snd .snd
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Maybe transferAxioms should really just output the axioms? We can then have inducedStructure instead of the current transferAxioms?

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I did this now. What do you think? @cangiuli @ecavallo @mzeuner

@mortberg mortberg merged commit 5494ce3 into agda:master Oct 18, 2020
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.

None yet

3 participants