The People's Refinement Logic
☆229Jan 1, 2023Updated 3 years ago
Alternatives and similar repositories for sml-redprl
Users that are interested in sml-redprl are comparing it to the libraries listed below
Sorting:
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆215Mar 25, 2022Updated 3 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Feb 20, 2019Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated this week
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- Experimental implementation of Cubical Type Theory☆594Sep 21, 2023Updated 2 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- 😎TT☆240Nov 20, 2025Updated 3 months ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- ☆28Jun 18, 2020Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆77Jul 30, 2018Updated 7 years ago
- papers of Per Martin Löf☆813Jan 30, 2024Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Apr 29, 2023Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- A proof assistant for general type theories☆311Aug 9, 2025Updated 6 months ago
- A Unifying Cartesian Cubical Set Model☆35Oct 14, 2019Updated 6 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- ☆18May 10, 2022Updated 3 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆58Aug 11, 2020Updated 5 years ago
- A demo implementation of a simple dependently-typed language☆619Nov 18, 2024Updated last year
- being bits and pieces I'm inclined to leave lying around☆56Jan 22, 2026Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- A formalized proof of a version of the initiality conjecture☆45Sep 10, 2020Updated 5 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Categorical logic from a categorical point of view☆81Oct 19, 2023Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Coq formalizations of functional languages.☆145Jul 2, 2020Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- A function definition package for Coq☆236Updated this week