effectfully / Cubes
A dependently typed type checker for a TT with intervals
☆22Updated 5 years ago
Alternatives and similar repositories for Cubes:
Users that are interested in Cubes are comparing it to the libraries listed below
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Type theory in type theory☆16Updated 12 years ago
- ☆17Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- A simple implementation of linear type theory☆38Updated 7 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- Linear map categories in Agda☆5Updated last year
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- secret project☆17Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 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
- ☆16Updated this week
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 6 years ago