Skip to content

Conversation

@aljungstrom
Copy link
Contributor

This PR contains a small modification of @stefaniatadama 's code in #1129 . There were some problems with showing that containers are closed under greatest fixed points due to issues with coinduction and the termination checker which forced us to include additional set assumptions. This PR removes those assumptions by introducing a bit of nasty path algebra instead:-)

@aljungstrom
Copy link
Contributor Author

(This PR depends on #1139)

(βg : (y : Y) (i : Ind) P i (βs y) X i)
(β̃₁ : Y M S Q)
(β̃₂ : (y : Y) (ind : Ind) Pos P MAlg ind (β̃₁ y) X ind)
(βh : (y : Y) Q (βs y) Y)
Copy link
Contributor

Choose a reason for hiding this comment

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

βh is written twice as an argument to this module.

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