RedPRL is a new proof assistant in the Nuprl tradition for Nominal Computational Type Theory.
Open-source contributors are the shock troops of the revolution! Join us now.
Papers & Talks
- Sterling, J. and Morrison, D. Type Refinements for the Working Class, 2016.
- Sterling, J. and Morrison, D. Syntax and Semantics of Abstract Binding Trees, 2016.
- Sterling, J. Designing the People's Refinement Logic, 2016. OPLSS Student Talks.
- Functional extensionality
- Squash and subset types
- Computational congruence
- Dependent refinement
- Well-scoped tactic scripts
- Computational effects: fresh name generation, local exceptions
DownloadRedPRL is written in Standard ML, and is available for download on GitHub.
History & Philosophy
negation of formalism consists in
decisively overthrowing the old intensional order of truth-as-derivability, and the
reversal of the prior relations between meaning theory and proof theory. The meaning
explanation is both concrete and definitive, and proof
theory is no longer a classifier of models, but a mere
means of implementation.
of the negation negation,
the standard semantics are generalized to a theory of Kripke logical
relations to account for transcendental phenomena, including continuity. The purely formal negative freedom
accorded by the toppled edifice is replaced with a living open-endedness,
emanating from the free generation of fresh objects.
Jon Sterling, Danny Gratzer, Vincent Rahli, Darin Morrison, David Christiansen, Eugene Akentyev and Ayberk Tosun contributed to the design and implementation of Classic JonPRL and RedPRL.