Today, everyone in #IT fancies himself a connoisseur of dependent types. But David MacQueen—a pillar in the ML #FP community and the designer of the ML module system—was already leading the way in this area four decades ago. His 1986 paper, “Using Dependent Types to Express Modular Structure”, was the first time I came across the term #DependentTypes.

I did not have the knowledge and the perspective to fully appreciate the significance of MacQueen work, back then. Nor was I aware of Constable’s #NuPRL and similar proof assistants exploiting dependent types, in those days.

https://www.cs.cmu.edu/~crary/819-f09/MacQueen86.pdf

It has been a while since I last time touched #nuprl but the way I think number theory proof is still affected by type theory
Is #NuPRL dead? I'm a bit surprised that the latest update on https://nuprl.org/ is from 2016. More generally, is extensional type theory as a foundation for real practical programming languages and proof assistants dead?
PRL Project Home - Proofs as Programs

implementing computational mathematics and providing logic-based tools that help automate programming

Using Allen's method [5] one can define n universes of #Nuprl in n+1 predicative universes of Coq [1, sec. 6.1].
It is just too ugly because of duplications of definitions at each level.
I think we can formalize n universes of the predicative fragment of Coq in n+1 universes of Nuprl.
https://sympa.inria.fr/sympa/arc/coq-club/2014-08/msg00128.html
coq-club - Re: [Coq-Club] Elimination Rules - arc

Found people interested in #OpenGenera, anyone interested in #Nuprl or #MetaPRL, the dependent type theory theorem prover? One year before I have got MetaPRL working with recent version of OCaml, but did not have enough knowledge and time to continue the development.