effectfully / CubesLinks
A dependently typed type checker for a TT with intervals
☆24Updated 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☆36Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- being an experiment with potato power☆23Updated 6 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 9 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 8 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated last week
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- STLC-related snippets in Agda☆16Updated 12 years ago