A long time ago (I can not find the thread), there was some discussion of making a library of universe polymorphic data types with some infrastructure around them. At BedRock Systems, we have recently released some of our code around this in support of a robust, universe polymorphic monads library. At the moment, this library is focused on programming rather than proving so there is not much theory to go along with these, though the theory will generally be the same as Coq's theory.
The library is available here: https://github.com/bedrocksystems/BRiCk/tree/master/coq-upoly
We welcome contributions and comments, especially from experts on universe polymorphism.
Thanks to @Yannick Zakowski for getting me justification for getting this library released.
I believe this was the thread in question? In any case, thanks for making this open!
Thanks a lot again @Gregory Malecha !
I got side tracked by a couple of deadlines, but I'll get back to my experiment of porting itrees/vellvm and surroundings to stdpp soon, and will try building on coq-upoly doing so!
Let us know if you have suggestions.
For CUDW Nicolas wants to
(Nicolas) implementation of a sort and universe polymorphic standard library
From BedRock, @Janno is attending, but he is aimed at a different project more in the kernel.
It would be great to have some cohesion here, but it depends on the goals of the project. Our library uses different conventions to the Coq standard library. I do feel like an update to the standard library with these new features could be a good time to break some compatibility in the name of modernizing the conventions, but that may hinder adoption. I'm sure David Swasey would be interested in discussing some of the thoughts for the future here if that would be of interest.
I'm sure David Swasey would be interested in discussing some of the thoughts for the future here if that would be of interest.
I'd be happy to help (but will not be attending CUDW).
Last updated: Oct 13 2024 at 01:02 UTC