☆21Apr 15, 2018Updated 8 years ago
Alternatives and similar repositories for coq-guarded-computational-type-theory
Users that are interested in coq-guarded-computational-type-theory are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 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
- Implementation of Nuprl's type theory in Coq☆47Feb 25, 2026Updated last month
- 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
- ☆18May 10, 2022Updated 3 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 8 years ago
- Higher Algebra with Opetopic Types☆16Mar 30, 2023Updated 3 years ago
- Files related to my paper "Continuity of Godel's system T functionals via effectful forcing". MFPS'2013. Electronic Notes in Theoretical …☆11Sep 21, 2021Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- Archive of the categories mailling list☆12Sep 8, 2020Updated 5 years ago
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- A Coq plugin that implements exceptions in Coq☆13Jan 7, 2021Updated 5 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Feb 22, 2018Updated 8 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Intrinsic Verification of Formal Grammar Theory☆28Apr 8, 2026Updated last week
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- A proof assistant.☆12Feb 19, 2016Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- A formalization of synthetic algebraic geometry in Agda☆14Jan 5, 2019Updated 7 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- ☆32Apr 17, 2023Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆218Mar 25, 2022Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆27Nov 27, 2023Updated 2 years ago
- Deploy open-source AI quickly and easily - Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆58Mar 11, 2026Updated last month
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Formalization of type theory☆22Jul 5, 2021Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 9 months ago
- Implementing grep in Agda☆33Jan 11, 2021Updated 5 years ago