jonsterling / coq-guarded-computational-type-theoryView external linksLinks
☆21Apr 15, 2018Updated 7 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
Sorting:
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- ☆18May 10, 2022Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆46Dec 3, 2024Updated last year
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 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
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 2 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- Archive of the categories mailling list☆11Sep 8, 2020Updated 5 years ago
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated 3 weeks ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 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
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- A formalization of synthetic algebraic geometry in Agda☆14Jan 5, 2019Updated 7 years ago
- Extra and extended datatypes for Lean 4☆12Nov 12, 2022Updated 3 years ago
- Practical type inference for arbitrary-rank types☆11May 25, 2019Updated 6 years ago
- A command-line parser for Standard ML☆21Dec 29, 2025Updated last month
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Feb 22, 2018Updated 7 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- ☆31Apr 17, 2023Updated 2 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- Higher Algebra with Opetopic Types☆16Mar 30, 2023Updated 2 years ago
- ☆14Nov 4, 2025Updated 3 months ago
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Apr 3, 2023Updated 2 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Apr 22, 2025Updated 9 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- JNumberTools is an open-source Java library for solving complex problems in combinatorics and number theory. Whether you're a researcher,…☆12May 13, 2025Updated 9 months ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Useful, efficient, precise binary schema modelling in Haskell☆15Aug 18, 2025Updated 5 months ago
- Formalization of type theory☆22Jul 5, 2021Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆40Sep 10, 2025Updated 5 months ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- Porting of software foundations book to Agda☆39Feb 16, 2014Updated 12 years ago