Implementation of Nuprl's type theory in Coq
☆47Jul 28, 2026Updated last month
Alternatives and similar repositories for NuprlInCoq
Users that are interested in NuprlInCoq are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆13May 15, 2017Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Feb 20, 2019Updated 7 years ago
- ☆21Apr 15, 2018Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 9 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- A formalization of category theory in cubical Agda☆59May 24, 2020Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 9 years ago
- Martin-Löf Extensible Specification and Simulator☆29Jul 1, 2015Updated 11 years ago
- ☆28Jun 18, 2020Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 9 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Multimode simple type theory as an Agda library.☆22Sep 18, 2024Updated last year
- 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
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Observational Type Theory as an Agda library☆59May 27, 2017Updated 9 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 10 years ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 9 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- An experimental type checker for a modal dependent type theory.☆122May 9, 2020Updated 6 years ago
- The People's Refinement Logic☆229Jan 1, 2023Updated 3 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 5 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆89Sep 13, 2021Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 8 years ago
- Research material of Erik Palmgren (1963–2019)☆21Apr 7, 2025Updated last year
- A bare-bones LCF-style proof assistant☆26Aug 13, 2019Updated 7 years ago
- 👹 A library for hierarchical names and lexical scoping☆28Jun 19, 2026Updated 2 months ago
- Agda code for experimenting with internal models of cubical type theory☆16Apr 3, 2018Updated 8 years ago
- my phd thesis☆26Aug 7, 2024Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆97Jan 10, 2018Updated 8 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆77Jul 30, 2018Updated 8 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- A dependent type theory with user defined data types☆48Oct 1, 2021Updated 4 years ago
- ☆34Apr 17, 2023Updated 3 years ago
- The Mechanization of Standard ML☆75Jul 18, 2022Updated 4 years ago
- Intrinsic Verification of Formal Grammar Theory☆28Aug 4, 2026Updated 3 weeks ago
- ☆11Jul 8, 2020Updated 6 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 11 years ago