An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: https://github.com/redprl/sml-redprl]
☆111Feb 20, 2019Updated 7 years ago
Alternatives and similar repositories for JonPRL
Users that are interested in JonPRL are comparing it to the libraries listed below
Sorting:
- Implementation of Nuprl's type theory in Coq☆47Feb 25, 2026Updated 3 weeks ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- The People's Refinement Logic☆229Jan 1, 2023Updated 3 years ago
- 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
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Robots powered by Constructive Reals☆34Nov 3, 2017Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- A simple XML module for Idris.☆13May 22, 2020Updated 5 years ago
- Simple lambda prover☆24Jul 6, 2015Updated 10 years ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Jul 10, 2015Updated 10 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
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆109Jun 2, 2017Updated 8 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- A small implementation of type inference☆80May 19, 2015Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Jan 5, 2015Updated 11 years ago
- Where my everyday research happens☆56Mar 10, 2026Updated last week
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- Old Nix expressions for Idris packaging. Idris support moved into Nixpkgs!☆28Sep 10, 2015Updated 10 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Experimental implementation of Cubical Type Theory☆595Sep 21, 2023Updated 2 years ago
- An enhanced unification algorithm for Coq☆59Mar 11, 2026Updated last week
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Jul 30, 2018Updated 7 years ago
- Link to preprints for POPL'18 and colocated events☆86Jun 16, 2018Updated 7 years ago
- Playing around with multicategories and operads☆16Jun 13, 2015Updated 10 years ago
- A dependently typed programming language, and verification tool☆27Apr 3, 2016Updated 9 years ago
- Reflection library for Coq☆12Sep 26, 2019Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago