effectfully / CubesLinks
A dependently typed type checker for a TT with intervals
☆23Updated 5 years ago
Alternatives and similar repositories for Cubes
Users that are interested in Cubes are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆35Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- being an experiment with potato power☆23Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- ☆17Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- ☆18Updated 3 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- ☆16Updated 4 months ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- ☆12Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week