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

Review “injective functions” paper↔algorithm equivalence proof #33

Closed
clange opened this issue Sep 4, 2013 · 1 comment
Closed
Assignees
Labels

Comments

@clange
Copy link
Member

clange commented Sep 4, 2013

Now that @caminati has committed a paper↔algorithm equivalence proof for “all injective functions from one set to another” in b.thy, I should review, reorganise, simplify and document it. And then, once more, announce it to Isabelle (as in #3).

@caminati noted about the relevance to Isabelle:

The formalization work spawned new relevant definitions: when a relation is a function, in a set-theoretical sense (runiq), the inverse operator, the pasting operator. Most importantly, it spawned a lot of basic results about those; which, apart from coding style, I feel make a useful addition to the Relation.thy already present in the standard library.

@ghost ghost assigned clange Sep 4, 2013
@clange
Copy link
Member Author

clange commented Jan 4, 2014

Reviewing, reorganising, simplifying and documenting have been done some time around September 2013.

I've rolled out "announcing" to #42.

@clange clange closed this as completed Jan 4, 2014
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant